Impact of network topology on efficiency of proximity measures for community detection
arXiv:2111.01229 · doi:10.1007/978-3-030-36687-2_16
Abstract
Many community detection algorithms require the introduction of a measure on the set of nodes. Previously, a lot of efforts have been made to find the top-performing measures. In most cases, experiments were conducted on several datasets or random graphs. However, graphs representing real systems can be completely different in topology: the difference can be in the size of the network, the structure of clusters, the distribution of degrees, the density of edges, and so on. Therefore, it is necessary to explicitly check whether the advantage of one measure over another is preserved for different network topologies. In this paper, we consider the efficiency of several proximity measures for clustering networks with different structures. The results show that the efficiency of measures really depends on the network topology in some cases. However, it is possible to find measures that behave well for most topologies.
References in corpus (7)
- The structure and function of complex networks
- Natural Scales in Geographical Patterns
- Benchmark graphs for testing community detection algorithms
- Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
- Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale
- Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
- The Walk Distances in Graphs