Effectively Detecting Communities by Adjusting Initial Structure via Cores

Abstract EN

Community detection is helpful to understand useful information in real-world networks by uncovering their natural structures.

In this paper, we propose a simple but effective community detection algorithm, called ACC, which needs no heuristic search but has near-linear time complexity.

ACC defines a novel similarity which is different from most common similarity definitions by considering not only common neighbors of two adjacent nodes but also their mutual exclusive degree.

According to this similarity, ACC groups nodes together to obtain the initial community structure in the first step.

In the second step, ACC adjusts the initial community structure according to cores discovered through a new local density which is defined as the influence of a node on its neighbors.

The third step expands communities to yield the final community structure.

To comprehensively demonstrate the performance of ACC, we compare it with seven representative state-of-the-art community detection algorithms, on small size networks with ground-truth community structures and relatively big-size networks without ground-truth community structures.

Experimental results show that ACC outperforms the seven compared algorithms in most cases.