| 一种改进的组织发现算法研究 |
| |
| 引用本文： | 王艳,熊淑华,梁云.一种改进的组织发现算法研究[J].通信技术,2012(2):76-80. |
| |
| 作者姓名： | 王艳 熊淑华 梁云 |
| |
| 作者单位： | 1. 四川大学电子信息学院,四川成都610064
2. 西南电子电信技术研究所,四川成都610041 |
| |
| 摘 要： | 复杂网络是对复杂系统的高度抽象,如何发现复杂网络中的组织结构已经成为近年来复杂网络的研究热点。该文分析了一种经典的组织发现算法(Betweenness算法),鉴于Betweenness算法在组织发现方面的不足,结合Wilkinson-Huberman算法以及互信息(MI)技术,提出了一种新的组织发现算法(WH-MI算法)。在理论分析的基础上,对WH-MI算法进行了实验验证,实验结果表明该算法能够准确、高效地发现复杂网络中的组织。
|
| 关 键 词： | 组织发现 边介数 互信息 |
An Improved Community Detection Algorithm |
| |
| WANG Yan,XIONG Shu-hua,LIANG Yun.An Improved Community Detection Algorithm[J].Communications Technology,2012(2):76-80. |
| |
| Authors: | WANG Yan XIONG Shu-hua LIANG Yun |
| |
| Institution: | 1.College of Electronics and Information Engineering,Sichuan University,Chengdu Sichuan 610064,China; 2.Southwest Electronics and Telecommunication Technology Research Institute,Chengdu Sichuan 610041,China) |
| |
| Abstract: | The complicated network is the high abstract of the complicated system and,how to find the community in complicated network now becomes a hot research topic.The paper discusses a traditional community detection algorithm（Betweenness algorithm）,thus for the disadvantages of the traditional algorithms and in combination of Wilkinson-Huberman algorithm with mutual information（MI） technology,a new community detection algorithm is proposed.Theoretical analysis and experiments are implemented to verify the performance of this new algorithm,and the results show that this algorithm is exact and effective in community detection. |
| |
| Keywords: | community detection edge Betweenness mutual information |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
