Name
Abstract | ||
|---|---|---|
Community detection is one of the important methods for understanding the mechanism behind the function of social networks. The recently developed label propagation algorithm (LPA) has been gaining increasing attention because of its excellent characteristics, such as a succinct framework, linear time and space complexity, easy parallelization, etc. However, several limitations of the LPA algorithm, including random label initialization and greedy label updating, hinder its application to complex networks. A new parallel LPA is proposed in this study. First, grey relational analysis is integrated into the label updating process, which is based on vertex similarity. Second, parallel propagation steps are comprehensively studied to utilize parallel computation power efficiently. Third, randomness in label updating is significantly reduced via automatic label selection and label weight thresholding. Experiments conducted on artificial and real social networks demonstrate that the proposed algorithm is scalable and exhibits high clustering accuracy. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.comnet.2016.06.002 | Computer Networks |
Keywords | Field | DocType |
Community detection,Parallel computation,Label propagation | Data mining,Computer science,Grey relational analysis,Algorithm,Complex network,Initialization,Thresholding,Time complexity,Cluster analysis,Scalability,Randomness | Journal |
Volume | Issue | ISSN |
107 | P1 | 1389-1286 |
Citations | PageRank | References |
10 | 0.56 | 12 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qishan Zhang | 1 | 76 | 17.14 |
| Qirong Qiu | 2 | 25 | 1.84 |
| Wenzhong Guo | 3 | 611 | 76.01 |
| Kun Guo | 4 | 46 | 4.86 |
| Naixue Xiong | 5 | 2413 | 194.61 |