摘要
提出了一种"元胞自动机"方式寻找社团结构的方法.该方法基于Radicchi等人于2004年提出的"强社团"定义,并对寻找该定义下的社团结构有极佳的效果,在128个格点的经典人工网的应用中可以达到100%正确划分.该方法具有较低的复杂度:O(N2lgN).
Cellular-automata was used in this work to detect community structure. The method was based on a definition of “strong community” which was given by Radicchi in 2004. Very good data were obtained in the detection of community structure under this definition. When applied to classical manual network with 128 vertices, the accuracy was 100%. The complexity of the method was O（n^2 lgn）.
出处
《北京师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2008年第2期153-156,共4页
Journal of Beijing Normal University(Natural Science)
基金
国家自然科学基金资助项目(70431002
70771011)
关键词
元胞自动机
社团划分
算法
cellular automata
community detection
algorithm
