Title
FAIMCS: A fast and accurate influence maximization algorithm in social networks based on community structures
Abstract
Finding a number of nodes that are able to maximize the spread of influence through the social network and are called influence maximization has numerous applications in marketing. One such application is to find influential members for promoting a product across a large network. Even though numerous algorithms have been proposed, challenges such as scalability, time constraints, and low accuracy have motivated the researchers for better solutions. Some of the newly proposed algorithms are scalable, but fail to provide adequate accuracy. On the other hand, some greedy algorithms provide a good level of accuracy but are very time consuming for large networks. In this paper, an algorithm is proposed called FAIMCS that can quickly find influential nodes across large networks with high accuracy. FAIMCS, reduces computational overhead considerably by eliminating major portions of the social network graph which have little influence. FAIMCS uses community detection algorithm to determine each community's quota of influential nodes based on the structure of that community. Finally, it obtains influential nodes from the candidate nodes. Experiment results show FAIMCS is faster than current algorithms and provides a high level of accuracy for large social networks.
Year
DOI
Venue
2021
10.1111/coin.12466
COMPUTATIONAL INTELLIGENCE
Keywords
DocType
Volume
community detection, community structure, influence maximization, information diffusion models, large scale networks
Journal
37
Issue
ISSN
Citations 
4
0824-7935
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Esmaeil Bagheri100.34
Gholamhossein Dastghaibyfard2214.55
Ali Hamzeh321429.47