北京信息科技大学 机构 信息与通信工程学院,北京,100101
纸质出版:2020
移动端阅览
涂佩文, 周金和. 基于节点合并信息熵的社团结构检测[J]. 微电子学与计算机, 2020, 37(7): 42-46.
TU Pei-wen, ZHOU Jin-he. Community structure detection based on node merging information entropy[J]. 2020, 37(7): 42-46.
为解决目前社团划分存在的复杂度高及划分精度低等问题,从信息熵理论角度出发提出一种新的社团结构检测算法.针对节点划分概率系统事件发生的不确定性,采用相似性指标计算各节点合并所提供的信息量,结合全局重要度进一步构造节点合并信息熵模型,通过熵函数的值判断具有最小不确定度的合并方案,运用层次聚类的思想实现最终社团划分.通过对真实网络数据集的对比分析,验证了该算法的有效性,且划分社团具有较高的模块度.
In order to solve the problems of high complexity and low division accuracy of the current community division
a new community structure detection algorithm is proposed from the perspective of information entropy theory. In view of the uncertainty of the occurrence of node division probability system events
the similarity index is used to calculate the information provided by node combination
and the further construction of node merge information entropy model is made by combining the global importance degree. The value of the entropy function is used to judge the merging scheme with the least uncertainty. Apply the idea of hierarchical clustering to realize the final community division. Through the comparison and analysis of real network datasets
the effectiveness of the algorithm is verified
and the divided community has a high degree of modularity.
ZHOU T, LINYUAN LÜ, ZHANG Y C. Predicting missing links via local information[J]. The European Physical Journal B, 2009, 71(4):623-630. DOI: 623
SHIGA M, TAKIGAWA I, MAMITSUKA H. A spectral clustering approach to optimally combining numericalvectors with a modular network[C]//13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, USA, 2007: 647-656.
NEWMAN M E J. Fast algorithm for detecting community structure in networks[J]. Physical Review E, 2004, 69(6):066133. DOI: 066133
NEWMAN M E J. Fast algorithm for detecting community structure in networks[J]. Physical Review E, 2004, 69(6):066133. DOI: 066133
GIRVAN M, NEWMAN M E J. Community structure in social and biological networks[J]. Proceedings of the National Academy of Sciences of the United States of America, 2002, 99(12):7821-7826. DOI: 7821
NEWMAN M EJ. Finding and evaluating community structure in networks[J]. Physical review E, 2004, 69(2):026113. DOI: 026113
DONETTI L, MUNOZ M A. Improved spectral algorithm for the detection of network communities[C]//8th Intnational Conference on Modeling Cooperative Behavior in the Social Sciences. New York, USA, 2005: 104-107.
张姣, 刘三阳, 白艺光.基于社团结构的组合信息重连策略[J].复杂系统与复杂性科学, 2019, 16(2):1-8. DOI: 1
罗明伟, 姚宏亮, 李俊照, 等.一种基于节点相异度的社团层次划分算法[J].计算机工程, 2014, 40(1):275-279. DOI: 275
邓凯旋, 陈鸿昶, 黄瑞阳.基于标签传播能力的改进LPA算法[J].计算机工程, 2018, 44(3):60-64. DOI: 60
丁明珠, 马英红, 李云.基于相似度指标的社团划分算法[J].计算机工程, 2019, 45(2):201-207. DOI: 201
李超逸, 张仰森, 佟玲玲.一种基于社区发现的微博个性化推荐算法[J].微电子学与计算机, 2017, 34(6):40-44. DOI: 40
张虎, 吴永科, 杨陟卓, 等.基于多层节点相似度的社区发现方法[J].计算机科学, 2018, 45(1):216-222. DOI: 216
CHEN L J, ZHANG Z K, LIU J H, et al. A vertex similarity index for better personalized recommendation[J]. Physica A: Statistical Mechanics and its Applications, 2017(466):607-615. DOI: 607
0
浏览量
15
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号