Beyond Implicit Constraint: Explicit Low-Rank Structured Subspace Learning for Fast Attributed Graph Clustering
ELSS learns an explicit and nonlinear low-rank subspace within a graph-structured embedding space, effectively un-covering latent cluster structures and introduces a homophily-aware adaptive graph filter, which dynamically calibrates smoothing intensity to preserve discriminative ego-information.