Refined Graph Encoder Embedding via Self-Training and Latent Community Recovery
arXiv:2405.12797 · doi:10.1007/s13278-025-01419-w
Abstract
This paper introduces a refined graph encoder embedding method, enhancing the original graph encoder embedding through linear transformation, self-training, and hidden community recovery within observed communities. We provide the theoretical rationale for the refinement procedure, demonstrating how and why our proposed method can effectively identify useful hidden communities under stochastic block models. Furthermore, we show how the refinement method leads to improved vertex embedding and better decision boundaries for subsequent vertex classification. The efficacy of our approach is validated through numerical experiments, which exhibit clear advantages in identifying meaningful latent communities and improved vertex classification across a collection of simulated and real-world graph data.
16 pages main + 4 pages appendix
References in corpus (19)
- The structure and function of complex networks
- Community structure in social and biological networks
- A Comprehensive Survey on Graph Neural Networks
- Cooperative Game Theory Approaches for Network Partitioning
- LINE: Large-scale Information Network Embedding
- Stochastic blockmodels and community structure in networks
- Structural Properties of the Caenorhabditis elegans Neuronal Network
- Spectral clustering and the high-dimensional stochastic blockmodel
- Consistency of community detection in networks under degree-corrected stochastic block models
- On a 'Two Truths' Phenomenon in Spectral Graph Clustering
- Universally consistent vertex classification for latent positions graphs
- One-Hot Graph Encoder Embedding
- Generalized Canonical Correlation Analysis for Classification
- Simulating and Modeling the Risk of Conversational Search
- Discovering Communication Pattern Shifts in Large-Scale Labeled Networks using Encoder Embedding and Vertex Dynamics
- Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection
- Synergistic Graph Fusion via Encoder Embedding
- Encoder Embedding for General Graph and Node Classification
- Fast and Scalable Multi-Kernel Encoder Classifier