Community Detection in Networks: A Rough Sets and Consensus Clustering Approach

TL;DR

This paper introduces RC-CCD, a novel framework combining Rough Set Theory and consensus clustering to improve community detection accuracy in complex networks, especially under uncertainty.

Contribution

It proposes a new rough clustering-based consensus method that enhances community detection reliability across diverse network conditions.

Findings

RC-CCD outperforms Louvain, Greedy, and LPA in accuracy.

The method is effective on synthetic networks with varying complexity.

Results show improved detection in large, dispersed networks.

Abstract

The objective of this paper is to propose a framework, called Rough Clustering-based Consensus Community Detection (RC-CCD), to effectively address the challenge of identifying community structures in complex networks from a set of different community partitions. The method uses a consensus approach based on Rough Set Theory (RST) to manage uncertainty and improve the reliability of community detection. The RC-CCD framework is tested on synthetic benchmark networks generated by the Lancichinetti-Fortunato-Radicchi (LFR) method, which simulate varying network scales, node degrees, and community sizes. Key findings demonstrate that RC-CCD outperforms established algorithms like Louvain, Greedy, and LPA in terms of normalized mutual information, showing superior accuracy and adaptability, particularly in networks with higher complexity, both in terms of size and dispersion. These results have significant implications for enhancing community detection in fields such as social and biological network analysis.