A new algorithm of detecting communities by Topological Centrality
Community structure is an important common property of complex network which has much theoretical significance for analyzing structure, mastering function, detecting implicit scheme and predicting activities. This paper reviews some popular detecting community methods. NTCDC Algorithm is proposed by analyzing weigh of nodes and edges TC values. The algorithm not only improves the precision, but also faster than GN and fast algorithm proposed by Newman. This paper demonstrate that the algorithm is higher effective and faster at discovering community structure in both computer-generated network and real-world network data than GN and fast algorithm.
complex network community structure topological centrality modularity
Zhang Yanping Yu jiajia He Fugui
Key Laboratory of Intelligent Computing & Signal Processing, Ministry of Education, Anhui University, Hefei 230039,China
国际会议
2010 International Conference on Digital Manufacturing and Automation(2010 数字制造与自动化国际会议 ICDMA 2010)
长沙
英文
50-53
2010-12-18(万方平台首次上网日期,不代表论文的发表时间)