One Node One Model: Featuring the Missing-Half for Graph Clustering
Xuanting Xie, Bingheng Li, Erlin Pan, Zhaochen Guo, Zhao Kang, Wenyu Chen
Abstract
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 the feature perspective.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1399f554-0690-4eb1-b519-1f97fe00be1eCited by top-tier papers10
- A Scalable Pretraining Framework for Link Prediction with Efficient AdaptationYu Song, Zhigang Hua, Harry Shomer, Yan Xie et al.KDD 2025 · 1 citation
- Federated Graph-level Clustering Network with Attribute InferenceRenda Han, Junlong Wu, Wenxuan Tu, Jingxin Liu et al.AAAI 2026 · 1 citation
- Disentangling Homophily and Heterophily in Multimodal Graph ClusteringZhaochen Guo, Zhixiang Shen, Xuanting Xie, Liangjian Wen et al.ACM MM 2025 · 1 citation
- Graph Domain Adaptation via Homophily-Agnostic Reconstructing StructureRuiyi Fang, Shuo Wang, Ruizhi Pu, Qiuhao Zeng et al.AAAI 2026 · 1 citation
- SAGA: Structural Aggregation Guided Alignment with Dynamic View and Neighborhood Order Selection for Multiview Graph Domain AdaptationRuiyi Fang, Jingyu Zhao, Shuo Wang, Ruizhi Pu et al.ICLR 2026
Builds on20
- Contrastive Multi-View Representation Learning on GraphsKaveh Hassani, Amir Hosein Khas AhmadiICML 2020 · 1,663 citations
- GraphSAINT: Graph Sampling Based Inductive Learning MethodHanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan et al.ICLR 2020 · 1,155 citations
- Structural Deep Clustering NetworkDeyu Bo, Xiao Wang, Chuan Shi, Meiqi Zhu et al.WWW 2020 · 645 citations
- Towards Deeper Graph Neural NetworksMeng Liu, Hongyang Gao, Shuiwang JiKDD 2020 · 496 citations
- Simple Spectral Graph ConvolutionHao Zhu, Piotr KoniuszICLR 2021 · 352 citations
Related papers
- Attribute-Missing Multi-view Graph ClusteringBowen Zhao, Qianqian Wang, Zhengming Ding, Quanxue GaoCVPR 2025
- Divide-Then-Rule: A Cluster-Driven Hierarchical Interpolator for Attribute-Missing GraphsYaowen Hu, Wenxuan Tu, Yue Liu, Miaomiao Li et al.ACM MM 2025 · 2 citations
- Cluster-Guided Contrastive Graph Clustering NetworkXihong Yang, Yue Liu, Sihang Zhou, Siwei Wang et al.AAAI 2023 · 169 citations
- Discriminative Attribute Graph Clustering Through Topology-Guided Contrastive LearningLing Ding, Zhizhi Yu, Cuiying HuoICML 2026
- Attention-driven Graph Clustering NetworkZhihao Peng, Hui Liu, Yuheng Jia, Junhui HouACM MM 2021 · 135 citations
