원문정보
초록
영어
Label propagation algorithm (LPA algorithm) is gotten widely attention by its simplicity, rapidity and greater effectiveness. Aimed at the problem of label updating process is sensitive to the order of nodes in LPA algorithm, an improved algorithm is proposed in this paper. The algorithm starts from the nodes with maximum degree in the network, according to its neighbor nodes’ community similarity index to decide whether its label setting, and then completes label setting in the first round; On this basis, it continues to carry out the iteration in label propagation algorithm, completes the entire network of community structure detection. The experimental results show that the improved algorithm is slightly better than the original algorithm at running time and number of iterations, has higher robustness, prevents the occurrence of the trivial solution.
목차
1. Introduction
2. Basic & Related Works
2.1. LPA Algorithm and its Improvements
2.2. Community Discovering Methods based on the Nodes with Maximum Degree
2.3. Index of Two Neighbors Nodes’ Community Similarity based on Local Information
3. Community Discovering Algorithm Based on Nodes with Maximum Degree and Label Propagation
3.1. Algorithm Introduction
3.2. Algorithm Framework
4. Experimental Results and Analysis
4.1. Experimental Results
4.2. Algorithm Analysis and Optimization
5. Conclusion and the Future Works
References