Community Detection Algorithm Based on Network Feature Vector Space

Abstract

Community detection plays an important role in the research of complex networks. It is very convenient to map the elements of the network into vector space to study the community structure of networks. Aiming at the problems that the number of communities is difficult to determine and the accuracy is not high in many community partition algorithms, a community detection algorithm based on network eigenvector space is proposed based on graph partition algorithm. The results show that the algorithm has better accuracy and the result of community partition is closer to the real community.