A Novel Approach for Discovering Local Community Structure in Networks

摘要：

　　The algorithms for discovering global community structure require the knowledge about entire network structures,which are still difficult and unrealistic to obtain from nowadays extremely large network.Several local algorithms that use local knowledge of networks to find the community for a given source node were proposed.However,these algorithms either require predefined thresholds which are hard to set manually or have lower precision rate.In this paper,we propose a novel method to discover local community for a given node.Firstly,we find the most similar node which is adjacent to the given node,and form the initial local community D together with the given node.Then,we calculate the connection degree of nodes belonging to D”s neighbors,and add the node whose connection degree is maximum to D if the local modularity measure will be increased.We evaluate our proposed method on well-known synthetic and real-world networks whose community structures are already given.The results of the experiment demonstrate that our algorithm is highly effective at discovering local community structure.

关键词： Local Community Discovering Community Structure Connection Degree Network Graph

作者: Jinglian Liu Daling Wang Weiji Zhao Shi Feng Yifei Zhang

作者单位: School of Computer Science and Engineering,Northeastern University,P.R.China;School of Information E School of Computer Science and Engineering,Northeastern University,P.R.China;Key Laboratory of Medic School of Information Engineering,Suihua University,P.R.China

会议类型: 国内会议

会议名称: 第十五届全国计算语言学学术会议(CCL2016)暨第四届基于自然标注大数据的自然语言处理国际学术研讨会(NLP-NABD-2016)

会议地点: 烟台

会议语种:英文

页码: 1-12

在线出版日期: 2016-10-14（万方平台首次上网日期，不代表论文的发表时间）