| 三种经典复杂网络社区结构划分算法研究 |
| |
| 引用本文： | 时京晶.三种经典复杂网络社区结构划分算法研究[J].电脑与信息技术,2011,19(4):42-43,79. |
| |
| 作者姓名： | 时京晶 |
| |
| 作者单位： | [1]长安大学信息工程学院,陕西西安710064;[2]西藏民族学院信息工程学院,陕西咸阳712082 |
| |
| 摘 要： | 社团结构是复杂网络的重要特征之一。针对复杂网络中社团划分问题，文章给出了三种经典的社团划分算法，阐述了各种算法的基本原理，并对各算法进行了适当的分析和比较，为实际应用中社团划分算法的选择提供了参考。
|
| 关 键 词： | 复杂网络 社区结构 Laplace图谱 Kernighan-Lin算法 GN算法 |
The Research of Three Typical Community Detection Algorithms in Complex Networks |
| |
| SHI Jing-jing.The Research of Three Typical Community Detection Algorithms in Complex Networks[J].Computer and Information Technology,2011,19(4):42-43,79. |
| |
| Authors: | SHI Jing-jing |
| |
| Affiliation: | SHI Jing-jing1,2(1.School of information Engineering,Chang'an University,Xi'an 710064,China,2.School of information Engineering,Tibet Nationalities Institute,Xianyang 712082,China) |
| |
| Abstract: | Community structure is one of important characteristics of complex networks. For community detection in complex networks, this paper presents three typical community detection methods, describes the basic principle of each method and does some analysis an |
| |
| Keywords: | complex networks community structure Laplace graph spectrum Kemighan-Lin algorithm GN algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
