| 基于连接矩阵的社区发现算法 |
| |
| 引用本文： | 常富蓉,陈新一.基于连接矩阵的社区发现算法[J].喀什师范学院学报,2013(6):41-43. |
| |
| 作者姓名： | 常富蓉 陈新一 |
| |
| 作者单位： | [1]喀什师范学院信息工程技术系,新疆喀什844008 [2]西北民族大学中国民族信息技术研究院,甘肃兰州730030 |
| |
| 基金项目： | 喀什师范学院校内课题资助项目（（13）2488）. |
| |
| 摘 要： | 以分歧点和矩阵连通度为依据,通过矩阵初等行列变换划分网络社区的算法,可准确划分社区个数已知的网络,其算法简捷清晰,复杂度相对较低.
|
| 关 键 词： | 复杂网络 社区发现 分歧点 连通度 |
Algorithm for Community Discovery Based on Connecting Matrix |
| |
| CHANG Fu-rong,Chen Xin-yi.Algorithm for Community Discovery Based on Connecting Matrix[J].Journal of Kashgar Teachers College,2013(6):41-43. |
| |
| Authors: | CHANG Fu-rong Chen Xin-yi |
| |
| Institution: | 1.Daparment of Information Engineering Technology,Kashgar Teachers College, Kashgar 844008,Xinjiang; 2.China Minorities Information Technology Institute, Northwest University for Nationalities, Lanzhou 730030,Gansu) |
| |
| Abstract: | In complex networks, community discovery is a important research area of theoretical significance and value of application. An algorithm for community discovery based on the bifurcation point and connectivity of matrix is given in the paper, the algorithm can search community in networks by matrix elementary transformation. The results show that it can accurately divide the number of known in networks community. It has a relatively low complexity. |
| |
| Keywords: | Complex networks Community discovery Bifurcation point Connectivity |
| 本文献已被 维普 等数据库收录！ |
