首页 | 官方网站   微博 | 高级检索  
     

一种基于增量式谱聚类的动态社区自适应发现算法
引用本文:蒋盛益,杨博泓,王连喜.一种基于增量式谱聚类的动态社区自适应发现算法[J].自动化学报,2015,41(12):2017-2025.
作者姓名:蒋盛益  杨博泓  王连喜
作者单位:1.广东外语外贸大学思科信息学院 广州 510006;
基金项目:国家自然科学基金(61572145),教育部人文社会科学研究青年项目(14YJC870021),广东省科技计划项目(2014A040401083,2015A030401093),广东省普通高校科技创新项目(2012KJCX0049),广东外语外贸大学研究生科研创新项目(15GWCXXM-40),广东大学生科技创新培育专项资金(308-GK151018)资助
摘    要:针对当前复杂网络动态社区发现的热点问题, 提出一种面向静态网络社区发现的链接相关线性谱聚类算法, 并在此基础上提出一种基于增量式谱聚类的动态社区自适应发现算法. 动态社区发现算法引入归一化图形拉普拉斯矩阵呈现复杂网络节点之间的关 系,采用拉普拉斯本征映射将节点投影到k维欧式空间.为解决离群节点影响谱聚类的效果和启发式确定复杂网络社区数量的问题, 利用提出的链接相关线性谱聚类算法发现初始时间片的社区结构, 使发现社区的过程能够以较低的时间开销自适应地挖掘复杂网络社区结构. 此后, 对于后续相邻的时间片, 提出的增量式谱聚类算法以前一时间片聚类获得的社区特征为基础, 通过调整链接相关线性谱聚类算法实现对后一时间片的增量聚类, 以达到自适应地发现复杂网络动态社区的目的. 在多个数据集的实验表明, 提出的链接相关线性谱聚类算法能够有效地检测出复杂网络中的社区结构以及基于 增量式谱聚类的动态社区自适应发现算法能够有效地挖掘网络中动态社区的演化过程.

关 键 词:谱聚类    拉普拉斯矩阵    拉普拉斯本征分析    增量聚类    社区检测    动态社区
收稿时间:2015-05-15

An Adaptive Dynamic Community Detection Algorithm Based on Incremental Spectral Clustering
JIANG Sheng-Yi,YANG Bo-Hong,WANG Lian-Xi.An Adaptive Dynamic Community Detection Algorithm Based on Incremental Spectral Clustering[J].Acta Automatica Sinica,2015,41(12):2017-2025.
Authors:JIANG Sheng-Yi  YANG Bo-Hong  WANG Lian-Xi
Affiliation:1.School of Informatics, Guangdong University of Foreign Studies, Guangzhou 510006;2.Guangdong University of Foreign Studies Library, Guangzhou 510420;3.Social Science Key Laboratory of Language Engineering and Computing of Guangdong Province, Guangzhou 510006
Abstract:To tackle the hot issue of dynamic community detection in complex networks, this paper proposes an adaptive dynamic community detection algorithm based on the spectral clustering algorithm of linear link-related approach for static community detection and the incremental spectral clustering. The dynamic community detection algorithm uses the normalized Laplacian matrix to present the relationships of the complex network nodes, and then uses the Laplacian eigen map to map the node into the k-dimensional Euclidean space. In order to solve the problems of the outliers to nodes and the heuristics to identify the number of communities, this paper applies the spectral clustering algorithm of linear link-related approach to detect the community structure of the initial time slice, which makes the process of the complex community detection in an adaptive and computationally inexpensive way. For the subsequent adjacent time slices, the incremental spectral clustering algorithm of this paper aims to detect the dynamic community of complex network adaptively by clustering results for the next time slice based on the foundation of community characteristics of the previous time slice, and adjusting the spectral clustering algorithm of linear link-related approach. Experimental results on a series of datasets show that the spectral clustering algorithm of linear link-related approach can detect the community structure in the complex networks effectively and that the adaptive dynamic community detection algorithm based on incremental spectral clustering can also mine the evolution of dynamic communities effectively.
Keywords:Spectral clustering  Laplacian matrix  Laplacian eigen analysis  incremental clustering  community detection  dynamic community
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号