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

基于连边距离矩阵的重叠社区发现
引用本文:张建国,黄瑞阳.基于连边距离矩阵的重叠社区发现[J].计算机应用研究,2017,34(9).
作者姓名:张建国  黄瑞阳
作者单位:国家数字交换系统工程技术研究中心,国家数字交换系统工程技术研究中心
基金项目:国家重点基础研究发展计划(973计划);创新研究群体科学基金
摘    要:现有重叠社团发现算法大多直接从相邻连边的相似性出发,不能有效利用网络的多层连边信息。基于此,本文提出了一种基于连边距离矩阵的重叠社区发现算法LDM。首先结合连边-节点-连边随机游走模型,以实现多级连边信息的有效利用,其次借助模糊聚类方法,处理连边距离矩阵以获取连边社区,最后根据扩展模块度调整和优化重叠社区结构。在人工网络和真实网络上的实验结果表明,所提算法能够有效提高重叠社区发现算法的准确度。

关 键 词:复杂网络    重叠社团发现  连边距离  随机游走
收稿时间:2016/6/28 0:00:00
修稿时间:2017/6/12 0:00:00

Overlapping community detecting based on link distance matrix
Affiliation:National Digital Switching System Engineering,
Abstract:Most overlapping community detecting algorithms ignore the similarity of non-adjacent edges, which reduces the accuracy of overlapping community detection. It is proposed an overlapping community detecting algorithm based on link distance matrix. Firstly, based on the link-node-link random walk model and superposed random walk index, LDM proposed a method to calculate the similarity of the non-adjacent edges in the network, which improves the utility of edge information. Then it uses the fuzzy clustering methods to deal with link distance matrix to obtain the edge community structure. Finally it adjusts and optimizes the overlapping community structure of the network, according to the extension module degree function. Compared with existing algorithms in LFR artificial networks and real networks, the experiment results show that the LDM algorithm can effectively improve the accuracy of overlapping community detection algorithm.
Keywords:Complex Network  Overlapping Community Detecting  Link Distance  Random Walk
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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