1. A high-performance algorithm for finding influential nodes in large-scale social networks.
- Author
-
Taherinia, Mohsen, Esmaeili, Mahdi, and Minaei-Bidgoli, Behrouz
- Subjects
- *
SOCIAL networks , *SOCIAL network analysis , *COMMUNITIES , *NP-hard problems - Abstract
As one of the significant issues in social networks analysis, the influence maximization problem aims to fetch a minimal set of the most influential individuals in the network to maximize the number of influenced nodes under a diffusion model. Several approaches have been proposed to tackle this NP-hard problem. The traditional approaches failed to develop an efficient and effective solution due to the exponential growth of the size of social networks (due to massive computational overhead). In this paper, a three-stage framework based on the community detection approach is devised, namely LGFIM. In the first stage, the search space was controlled by partitioning the network into communities. Simultaneously, three heuristic methods were presented for modifying the community detection algorithm to extract the optimal communities: core nodes selection, capacity constraint on communities, and communities combination. These extracted communities were highly compatible with the information propagation mechanism. The next stages apply a scalable and robust algorithm at two different levels of the network: 1. Exploring the local scope of communities to select the most influential nodes of each community and construct the potential influential nodes set 2. Exploring the global scope of the network to select the target influential nodes among potential influential nodes set. Experimental results on various real datasets proved that LGFIM could achieve remarkable results compared with the state-of-the-art algorithms, especially acceptable influence spread, much better running time, and more applicable to massive social networks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF