Local Community Detection Algorithm Based on Minimal Cluster

Abstract EN

In order to discover the structure of local community more effectively, this paper puts forward a new local community detection algorithm based on minimal cluster.

Most of the local community detection algorithms begin from one node.

The agglomeration ability of a single node must be less than multiple nodes, so the beginning of the community extension of the algorithm in this paper is no longer from the initial node only but from a node cluster containing this initial node and nodes in the cluster are relatively densely connected with each other.

The algorithm mainly includes two phases.

First it detects the minimal cluster and then finds the local community extended from the minimal cluster.

Experimental results show that the quality of the local community detected by our algorithm is much better than other algorithms no matter in real networks or in simulated networks.