Uncovering Overlap Community Structure in Complex Networks Using Particle Competition

摘要

Identification and classification of overlap nodes in communities is an important topic in data mining. In this paper, a new clustering method to uncover overlap nodes in complex networks is proposed. It is based on particles walking and competing with each other, using random-deterministic movement. The new community detection algorithm can output not only hard labels, but also continuous-valued output (soft labels), which corresponds to the levels of membership from the nodes to each of the communities. Computer simulations were performed with synthetic and real data and good results were achieved.