Name
Abstract | ||
|---|---|---|
Community structure is a common feature in real-world network. Overlap community detection is an important method to analyze topology structure and function of the network. Most algorithms are based on the network structure, without considering the node attributes. In this paper, we propose an overlapping community detection algorithm based on node convergence degree which combines the network topology with the node attributes. In our method, PageRank algorithm is used to get the importance of each node in the global network and utilize the local network (local neighbors) to measure the structure convergence degree. Then, node convergence degree combining node attributes and structure convergence degree is designed. Finally, the overlap communities can be identified by the Spectral Cluster based on node convergence degree. Experiments results demonstrate effectiveness and better performance of our method. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/DASC-PICom-DataCom-CyberSciTec.2016.46 | 2016 IEEE 14th Intl Conf on Dependable, Autonomic and Secure Computing, 14th Intl Conf on Pervasive Intelligence and Computing, 2nd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech) |
Keywords | Field | DocType |
community structure,overlap,PageRank,Node convergence degree | Convergence (routing),PageRank,Community structure,Algorithm design,Global network,Computer science,Algorithm,Theoretical computer science,Network topology,Local area network,Cluster analysis | Conference |
ISBN | Citations | PageRank |
978-1-5090-4066-7 | 1 | 0.37 |
References | Authors | |
7 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weimin Li | 1 | 63 | 25.40 |
| Shu Jiang | 2 | 1 | 0.37 |
| Huaikou Miao | 3 | 451 | 68.03 |
| Xiaokang Zhou | 4 | 225 | 25.50 |
| Jin, Q. | 5 | 233 | 33.40 |