One Node One Model: Featuring the Missing-Half for Graph Clustering

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.

Authors

Institutions

Publication Details

Journal
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2025-04-11
DOI
https://doi.org/10.1609/aaai.v39i20.35473
Citations
6
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
2.59

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

One Node One Model: Featuring the Missing-Half for Graph Clustering

Xuanting Xie, Erlin Pan, Zhaochen Guo, Zhao Kang et al.
6 citations
Proceedings of the AAAI Conference on Artificial Intelligence
Graph Theory and Algorithms
2.59
article

One Node One Model: Featuring the Missing-Half for Graph Clustering

Xuanting Xie, Erlin Pan, Zhaochen Guo, Zhao Kang, Bingheng Li, Wenyu Chen
article en
6 citations

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.

Proceedings of the AAAI Conference on Artificial IntelligenceVol. 39(20)
University of Electronic Science and Technology of China (CN), Alibaba Group (United States) (US), Michigan State University (US)
National Natural Science Foundation of China
Openalex Percentile: Top 10%
Graph Theory and Algorithms
2.59
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.