DocumentCode :
2382445
Title :
An algorithm for detecting overlapping community structure in complex networks
Author :
Wu, Sen ; Huang, Yue ; Xiong, Deying ; Wei, Guiying ; Gao, Xuedong
Author_Institution :
Sch. of Econ. & Manage., Univ. of Sci. & Technol. Beijing, Beijing, China
fYear :
2011
fDate :
9-12 Oct. 2011
Firstpage :
2221
Lastpage :
2226
Abstract :
It is a general problem in the data mining field to detect the overlapping community structure in a complex network. A novel approach is presented in this paper to identify communities based on core vertices and shared neighbors, which can find both separate and overlapping community structures in networks. Experimental results on synthetic and real-world networks show that the new algorithm is effective and efficient in identification of communities and it can find overlapping and bridge vertices.
Keywords :
complex networks; data mining; network theory (graphs); bridge vertices; complex networks; core vertices; data mining field; overlapping community structure; overlapping vertices; real-world networks; separate community structures; shared neighbors; synthetic networks; Algorithm design and analysis; Bridges; Clustering algorithms; Communities; Complex networks; Complexity theory; Partitioning algorithms; bridge vertex; community structure; complex network; overlapping vertex;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man, and Cybernetics (SMC), 2011 IEEE International Conference on
Conference_Location :
Anchorage, AK
ISSN :
1062-922X
Print_ISBN :
978-1-4577-0652-3
Type :
conf
DOI :
10.1109/ICSMC.2011.6084007
Filename :
6084007
Link To Document :
بازگشت