摘要
以分歧点和矩阵连通度为依据,通过矩阵初等行列变换划分网络社区的算法,可准确划分社区个数已知的网络,其算法简捷清晰,复杂度相对较低.
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.
出处
《喀什师范学院学报》
2013年第6期41-43,共3页
Journal of Kashgar Teachers College
基金
喀什师范学院校内课题资助项目((13)2488)
关键词
复杂网络
社区发现
分歧点
连通度
Complex networks
Community discovery
Bifurcation point
Connectivity
