Embedding-based Silhouette Community Detection
Not on the map. Why?
Abstract (arXiv)
Mining complex data in the form of networks is of increasing interest in many scientific disciplines. Network communities correspond to densely connected subnetworks, and often represent key functional parts of real-world systems. In this work, we propose Silhouette Community Detection (SCD), an approach for detecting communities, based on clustering of network node embeddings, i.e. real valued representations of nodes derived from their neighborhoods. We investigate the performance of the proposed SCD approach on 234 synthetic networks, as well as on a real-life social network. Even though SCD is not based on any form of modularity optimization, it performs comparably or better than state-of-the-art community detection algorithms, such as the InfoMap and Louvain algorithms. Further, we demonstrate how SCD's outputs can be used along with domain ontologies in semantic subgroup discovery, yielding human-understandable explanations of communities detected in a real-life protein interaction network. Being embedding-based, SCD is widely applicable and can be tested out-of-the-box as part of many existing network learning and exploration pipelines.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 1; 2026: 1.
4 papers.
- 2023A Comprehensive Review of Community Detection in Graphscited by 12
- 2023CARL-G: Clustering-Accelerated Representation Learning on Graphscited by 5
- 2025HorNets: Learning from Discrete and Continuous Signals with Routing Neural Networkscited by 0
- 2026Incremental Graph Construction Enables Robust Spectral Clustering of Textscited by 0
- 2026Incremental Graph Construction Enables Robust Spectral Clustering of Texts3 Mar 2026
- 2025HorNets: Learning from Discrete and Continuous Signals with Routing Neural Networks24 Jan 2025
- 2023A Comprehensive Review of Community Detection in Graphs21 Sep 2023
- 2023CARL-G: Clustering-Accelerated Representation Learning on Graphs12 Jun 2023