TY - JOUR
T1 - Overlap community detection using spectral algorithm based on node convergence degree
AU - Li, Weimin
AU - Jiang, Shu
AU - Jin, Qun
PY - 2017
Y1 - 2017
N2 - Community structure is a typical feature of complex networks in cyberspace, and community detection is considered to be crucial to understanding the topology structure, network function and social dynamics of cyberspace. However, some particular nodes may simultaneously belong to several communities in cyberspace. Though there are many algorithms to detect the overlapping communities, most of them are based on the network structure without considering the attributes of the nodes. In this paper, we focus on the convergence characteristic of network and propose an overlap community detection algorithm based on the node convergence degree, which is defined as a combination of attribute convergence degree and structure convergence degree. It combines the network topology with the attributes of the nodes and considers both local and global information of a node. An improved PageRank algorithm is used to get the importance of each node in the global network, while the information of local network is used to measure the structure convergence degree. The overlap communities are thus identified by spectral cluster based on the node convergence degree. Finally, experiment results demonstrate the effectiveness and better performance of our proposed method.
AB - Community structure is a typical feature of complex networks in cyberspace, and community detection is considered to be crucial to understanding the topology structure, network function and social dynamics of cyberspace. However, some particular nodes may simultaneously belong to several communities in cyberspace. Though there are many algorithms to detect the overlapping communities, most of them are based on the network structure without considering the attributes of the nodes. In this paper, we focus on the convergence characteristic of network and propose an overlap community detection algorithm based on the node convergence degree, which is defined as a combination of attribute convergence degree and structure convergence degree. It combines the network topology with the attributes of the nodes and considers both local and global information of a node. An improved PageRank algorithm is used to get the importance of each node in the global network, while the information of local network is used to measure the structure convergence degree. The overlap communities are thus identified by spectral cluster based on the node convergence degree. Finally, experiment results demonstrate the effectiveness and better performance of our proposed method.
KW - Community structure
KW - Node convergence degree
KW - Overlap
KW - PageRank
UR - http://www.scopus.com/inward/record.url?scp=85028992728&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028992728&partnerID=8YFLogxK
U2 - 10.1016/j.future.2017.08.028
DO - 10.1016/j.future.2017.08.028
M3 - Article
AN - SCOPUS:85028992728
SN - 0167-739X
JO - Future Generation Computer Systems
JF - Future Generation Computer Systems
ER -