.png){kind=icon}
.png){kind=icon}
Return
PHG: A Three-Phase Algorithm for Influence Maximization Based on Community Structure
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2912628.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The main purpose of influence maximization is to find a subset of key nodes that could maximize the spread of information under a certain diffusion model. In recent years, many studies have focused on the problem of influence maximization. However, these studies usually ignore the role of community structure which captures a significant effect on the process of influence propagation. To address above problem, we propose a novel hybrid algorithm PHG, which is a three-phase algorithm for influence maximization based on community structure. In our algorithm the influence propagation process is divided into three phases: 1) partition phase; 2) heuristic phase; and 3) greedy phase. Specifically, we first design an efficient algorithm CCSC that finds key nodes in each community to construct a candidate set by detecting community structure. Second, we find the most potential influence nodes from a candidate set by combing the influence weight of nodes and the community influence of nodes through the analysis of the community structure of the impact on nodes. Finally, we greedily select the nodes with maximization marginal gain from remaining a candidate set. The extensive experimental results on artificial and real-world social networks show that our algorithm obtains a better influence spread as well as an acceptable running time.
Keywords:
Community structure
heuristic phase
influence maximization
greedy phase
partition phase
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
No organization information available