One Node One Model: Featuring the Missing-Half for Graph Clustering
Not on the map. Why?
Abstract (arXiv)
Most existing graph clustering methods primarily focus on exploiting topological structure, often neglecting the ``missing-half" node feature information, especially how these features can enhance clustering performance. This issue is further compounded by the challenges associated with high-dimensional features. Feature selection in graph clustering is particularly difficult because it requires simultaneously discovering clusters and identifying the relevant features for these clusters. To address this gap, we introduce a novel paradigm called ``one node one model", which builds an exclusive model for each node and defines the node label as a combination of predictions for node groups. Specifically, the proposed ``Feature Personalized Graph Clustering (FPGC)" method identifies cluster-relevant features for each node using a squeeze-and-excitation block, integrating these features into each model to form the final representations. Additionally, the concept of feature cross is developed as a data augmentation technique to learn low-order feature interactions. Extensive experimental results demonstrate that FPGC outperforms state-of-the-art clustering methods. Moreover, the plug-and-play nature of our method provides a versatile solution to enhance GNN-based models from a feature perspective.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Dec 2024.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 5; 2026: 2.
7 papers.
- 2025Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology Alignmentcited by 42
- 2025On the Benefits of Attribute-Driven Graph Domain Adaptationcited by 19
- 2025Homophily Enhanced Graph Domain Adaptationcited by 9
- 2025Cooperation of Experts: Fusing Heterogeneous Information with Large Margincited by 6
- 2026Graph Domain Adaptation via Homophily-Agnostic Reconstructing Structurecited by 3
- 2025Attention Beyond Neighborhoods: Reviving Transformer for Graph Clusteringcited by 0
- 2026Selective Hypergraph Refinement for Frozen Graph Clusteringcited by 0
- 2026Selective Hypergraph Refinement for Frozen Graph Clustering3 Sep 2026
- 2026Graph Domain Adaptation via Homophily-Agnostic Reconstructing Structure7 Feb 2026
- 2025Attention Beyond Neighborhoods: Reviving Transformer for Graph Clustering18 Sep 2025
- 2025Cooperation of Experts: Fusing Heterogeneous Information with Large Margin27 May 2025
- 2025Homophily Enhanced Graph Domain Adaptation26 May 2025
- 2025On the Benefits of Attribute-Driven Graph Domain Adaptation4 Feb 2025
- 2025Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology Alignment4 Feb 2025