摘要
分析了两种传统群组发现算法——Betweenness算法和Wu-Huberman算法。鉴于传统群组发现算法不具有普遍适用性,借鉴Wu-Huberman算法思想提出一种新的普遍适用的群组发现算法——M-based Wu-Huberman算法。在理论分析基础上对M-based Wu-Huberman算法进行了实验验证,实验结果表明该算法能有效应用于群组发现。
Two traditional community detection algorithms—Betweenness algorithm and Wu-Huberman algorithm were studied.Since traditional algorithms are lackof universal applicability,a new community detection algorithm—M-based Wu-Huberman algorithm was proposed by referring the conception of Wu-Huberman algorithm.Theoretical analyses and experiments were carried out to verify this new algorithm s performances.Experimental results show that it is effective in community detection.
出处
《计算机应用与软件》
CSCD
2009年第11期67-69,共3页
Computer Applications and Software
基金
国家重点实验室基金项目(9140C860303060C86)
