Improving community detection via community association strength scores
arXiv:2501.17817 · doi:10.1007/978-3-031-92898-7_6
Abstract
Community detection methods play a central role in understanding complex networks by revealing highly connected subsets of entities. However, most community detection algorithms generate partitions of the nodes, thus (i) forcing every node to be part of a community and (ii) ignoring the possibility that some nodes may be part of multiple communities. In our work, we investigate three simple community association strength (CAS) scores and their usefulness as post-processing tools given some partition of the nodes. We show that these measures can be used to improve node partitions, detect outlier nodes (not part of any community), and help find nodes with multiple community memberships.
10 pages, 8 figures, 2 tables
References in corpus (14)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- From Louvain to Leiden: guaranteeing well-connected communities
- Benchmark graphs for testing community detection algorithms
- Link communities reveal multiscale complexity in networks
- Finding statistically significant communities in networks
- Clique percolation in random networks
- Clique Graphs and Overlapping Communities
- Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network
- Ensemble Clustering for Graphs
- Ensemble Clustering for Graphs: Comparisons and Applications
- Artificial Benchmark for Community Detection with Outliers (ABCD+o)
- AOC; Assembling Overlapping Communities