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

谱聚类在社团发现中的应用
引用本文:彭静,廖乐健,翟英,仇晶.谱聚类在社团发现中的应用[J].北京理工大学学报,2016,36(7):701-705.
作者姓名:彭静  廖乐健  翟英  仇晶
作者单位:河北科技大学信息科学与工程学院,河北,石家庄050018;北京理工大学计算机学院,北京,100081;河北经贸大学信息技术学院,河北,石家庄050061
基金项目:国家“九七三”计划项目(2013CB329605);国家自然科学基金资助项目(61300120);河北省自然科学基金资助项目(F2012208016);河北省教育厅资助项目(YQ2013032)
摘    要:在分析谱聚类原理的基础上,研究了其在社团发现中的应用,提出了快速估计社团数量的新方法.该方法通过计算和分析Laplacian矩阵特征值的分布来估计社团的数量,利用K-means算法对Laplacian矩阵特征向量构造的向量空间进行聚类,实现社团的发现.该算法在真实社会网络和合成网络上做了测试,验证了在社团发现中的准确性和有效性. 

关 键 词:Laplacian矩阵  谱聚类  K-means算法  社团发现
收稿时间:2014/12/10 0:00:00

Spectral Clustering for Community Detection
PENG Jing,LIAO Le-jian,ZHAI Ying and QIU Jing.Spectral Clustering for Community Detection[J].Journal of Beijing Institute of Technology(Natural Science Edition),2016,36(7):701-705.
Authors:PENG Jing  LIAO Le-jian  ZHAI Ying and QIU Jing
Institution:1.School of Information Science and Engineering, Hebei University of Science and Technology, Shijiazhuang, Hebei 050018, China2.School of Computer Science, Beijing Institute of Technology, Beijing 100081, China3.School of Information and Technology, Hebei University of Economics and Business, Shijiazhang, Hebei 050061, China
Abstract:In this paper spectral clustering was applied to detect the community in social network, and a new method was proposed to estimate the number of communities. According to this new method, the number of communities was estimated by calculating and analyzing the eigenvalues distribution of Laplacian matrix. K-means algorithm was used to clustering vector space which was constructed by eigenvectors of Laplacian matrix. The method was tested on a range of examples, including real-world and synthetic networks. Experimental results show that the method for community detection is accurate and effective.
Keywords:Laplacian matrix  spectral clustering  K-means algorithm  community detection
本文献已被 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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