mlsanityData to 7 Oct 2026

Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection

arXiv 2301.11290 ↗First posted 18 Jan 2023cs.SI cs.LG stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

In this paper, we introduce a novel and computationally efficient method for vertex embedding, community detection, and community size determination. Our approach leverages a normalized one-hot graph encoder and a rank-based cluster size measure. Through extensive simulations, we demonstrate the excellent numerical performance of our proposed graph encoder ensemble algorithm.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 5 of its 30 references that are in the map. First posted on arXiv 18 Jan 2023.

Builds on

5 of 30 references.

References · 5

  1. 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 379
  2. 2017Community Detection and Stochastic Block Modelscited by 317
  3. 2016Community Detection in Degree-Corrected Block Modelscited by 36
  4. 2018On a 'Two Truths' Phenomenon in Spectral Graph Clusteringcited by 24
  5. 2021One-Hot Graph Encoder Embeddingcited by 16

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 4; 2025: 1.

8 papers.