A Modularity Degree Based Heuristic Community Detection Algorithm

Abstract EN

A community in a complex network can be seen as a subgroup of nodes that are densely connected.

Discovery of community structures is a basic problem of research and can be used in various areas, such as biology, computer science, and sociology.

Existing community detection methods usually try to expand or collapse the nodes partitions in order to optimize a given quality function.

These optimization function based methods share the same drawback of inefficiency.

Here we propose a heuristic algorithm (MDBH algorithm) based on network structure which employs modularity degree as a measure function.

Experiments on both synthetic benchmarks and real-world networks show that our algorithm gives competitive accuracy with previous modularity optimization methods, even though it has less computational complexity.

Furthermore, due to the use of modularity degree, our algorithm naturally improves the resolution limit in community detection.