Detecting Community Structure in Complex Networks Using K-means Algorithm

摘要

There are considerable interest in algorithms for detecting community structure, which is fundamental for analyzing the relationship between structure and function in complex networks. In this paper, we propose Mapping Vertex into Vector (MVV) algorithm, which can convert complex networks nodes to vector, based on the algorithm, we propose K-means algorithm for detecting community structure based on MVV. Finally, experiments show that the algorithm presented in this paper is of high accuracy with good performance.