Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering and Applications》 2010-03
Add to Favorite Get Latest Update

Heuristic algorithm for detecting overlapping communities

WAN Xue-fei,CHEN Duan-bing,FU Yan School of Computer Science and Engineering,University of Electronic Science and Technology of China,Chengdu 610054,China  
A heuristic algorithm is proposed to detect overlapping communities in this paper.The algorithm is based on the local modularity and the vertex with greatest degree is considered as the initial community.Then expanding the community by putting the adjacent vertex which has maximal contribution into it.Furthermore,the algorithm takes into account the overlapping property of community.If there are border vertices which contribute greatly to more than one community,adding them to these communities.Finally,In order to make the result more reasonable,the detected communities is adjusted according to overlapping coefficient. Two typical social networks,Zachary and American College Football,are applied to the algorithm.The results show that it can detect overlapping communities rapidly and correctly and also mine the border vertices.
【Fund】: 国家高技术研究发展计划(863)No.2006AA01Z414;; 国家高技术研究发展计划(863)No.2007AA01Z440;; 国家242信息安全计划项目No.(242)2007B27);; 四川省应用技术研究与开发项目支撑计划No.2008GZ0009;; 中国博士后科学基金资助项目 No.20080431273~~
【CateGory Index】: TP301.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved