DocumentCode :
2732259
Title :
A New Method for Identifying Detected Communities Based on Graph Substructure
Author :
Kameyama, Shumei ; Uchida, Makoto ; Shirayama, Susumu
Author_Institution :
Univ. of Tokyo, Tokyo
fYear :
2007
fDate :
5-12 Nov. 2007
Firstpage :
263
Lastpage :
267
Abstract :
Many methods have been developed that can detect community structures in complex networks. The detection methods can be classified into three groups based on their characteristic properties. In this study, the inherent features of the detection methods were used to develop a method that identifies communities extracted using a given community detection method. Initially, a common detection method is used to divide a network into communities. The communities are then identified using another detection method from a different class. In this paper, the community structures are first extracted from a network using the method proposed by Newman and Girvan. The extracted communities are then identified using the proposed detection method that is an extension of the vertex similarity method proposed by Leicht et al. The proposed method was used to identify communities in a blog network (blogosphere) and in a Wikipedia word network.
Keywords :
complex networks; graph theory; information networks; pattern clustering; Wikipedia word network; blog network; common detection method; complex networks; detected communities; graph substructure; vertex similarity method; Clustering methods; Complex networks; Computer vision; Data mining; Information services; Intelligent agent; Internet; Pattern analysis; Web sites; Wikipedia; Identification of communityClusteringComplex networkGraph substructure;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Web Intelligence and Intelligent Agent Technology Workshops, 2007 IEEE/WIC/ACM International Conferences on
Conference_Location :
Silicon Valley, CA
Print_ISBN :
0-7695-3028-1
Type :
conf
DOI :
10.1109/WI-IATW.2007.102
Filename :
4427585
Link To Document :
بازگشت