首页 | 本学科首页   官方微博 | 高级检索  
     

基于密度聚类的增量动态社区发现算法
引用本文:郭昆,彭胜波,陈羽中,郭文忠. 基于密度聚类的增量动态社区发现算法[J]. 模式识别与人工智能, 2018, 31(11): 965-978. DOI: 10.16451/j.cnki.issn1003-6059.201811001
作者姓名:郭昆  彭胜波  陈羽中  郭文忠
作者单位:1.福州大学数学与计算机科学学院 福学350116
2.福州大学福建省网络计算与智能信息处理重点实验室 福学350116
3.福州大学空间数据挖掘与信息共享教育部重点实验室 福学350116
基金项目:国家自然科学基金项目(No.61300104,61300103,61672158)、福建省自然科学基金项目(No.2013J01230,2014J01232)、福建省高校杰出青年科学基金项目(No.JA12016)、福建省高等学校新世纪优秀人才支持计划项目(No.JA13021)、福建省杰出青年科学基金项目(No. 2014J06017,2015J06014)、福建省科技创新平台计划项目(No.2009J1007,2014H2005)、福建省高校产学合作项目(No.2014H6014,2017H6008)、海西政务大数据应用协同创新中心资助
摘    要:现实世界中社交网络中的节点和边随时间动态增加或消失,导致网络中的社区结构也随之发生变化,因此,文中提出基于密度聚类的增量动态社区发现算法.首先,基于改进后的DBSCAN生成初始时刻社区.然后,提出边变化率指标,并结合余弦相似度指标确定相邻时刻邻居发生变化的节点及其邻居节点的社区归属调整.在进行社区归属度计算时,不仅考虑节点直接邻居的影响,还考虑间接邻居的影响.最后,通过迭代更新模块度增益进行社区合并,以减少噪声社区的干扰.在人工数据集和真实数据集上的实验表明,文中算法可以有效应对网络结构突变和增量计算累积误差带来的影响,具有较低的时间复杂度.

关 键 词:动态社区发现  密度聚类  边变化率  模块度  
收稿时间:2018-05-31

Incremental Dynamic Community Detection Algorithm Based on Density Clustering
GUO Kun,PENG Shengbo,CHEN Yuzhong,GUO Wenzhong. Incremental Dynamic Community Detection Algorithm Based on Density Clustering[J]. Pattern Recognition and Artificial Intelligence, 2018, 31(11): 965-978. DOI: 10.16451/j.cnki.issn1003-6059.201811001
Authors:GUO Kun  PENG Shengbo  CHEN Yuzhong  GUO Wenzhong
Affiliation:1.College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116
2.Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou 350116
3.Key Laboratory of Spatial Data Mining and Information Sharing, Ministry of Education, Fuzhou University, Fuzhou 350116
Abstract:The community structures of social networks in the real world are always varying with nodes and edges of social networks increasing or disappearing dynamically as time goes by. In this paper, an incremental dynamic community detection algorithm based on density clustering is proposed. Firstly, the initial communities are generated according to the improved DBSCAN algorithm. Then, an index of edge variation rate is proposed and it is combined with the cosine similarity index to determine the community belonging adjustment process of the nodes whose neighbors vary in adjacent moment. In addition, both direct and indirect neighbor nodes are taken into account during the calculation of community belongingness.Finally, the communities are merged by iteratively updating the modularity gain to reduce the interference of noise communities. Experimental results on artificial datasets and real networks show that the proposed algorithm effectively copes with the variation of the network structures and incremental calculation cumulative errors with a low time complexity.
Keywords:Dynamic Community Detection  Density Clustering  Edge Variation Rate  Modularity  
点击此处可从《模式识别与人工智能》浏览原始摘要信息
点击此处可从《模式识别与人工智能》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号