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 a feature perspective.
Code (1)
Tasks
ClusteringData Augmentationfeature selectionGraph ClusteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs
Real-world graphs generally have only one kind of tendency in their connections. These connections are either homophily-prone or heterophily-prone. While graphs with homophily-prone edges tend to connect nodes with the s…
Attribute-Missing Multi-view Graph Clustering
The success of existing deep multi-view graph clustering methods is based on the assumption that node attributes are fully available across all views. However, in practical scenarios, node attributes are frequently m…
AttributeClusteringGraph ClusteringDivide-Then-Rule: A Cluster-Driven Hierarchical Interpolator for Attribute-Missing Graphs
Deep graph clustering (DGC) for attribute-missing graphs is an unsupervised task aimed at partitioning nodes with incomplete attributes into distinct clusters. Addressing this challenging issue is vital for practical app…
Graph ClusteringClustering multilayer graphs with missing nodes
Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. S…
ClusteringStochastic Block ModelClustering-Oriented Generative Attribute Graph Imputation
Attribute-missing graph clustering has emerged as a significant unsupervised task, where only attribute vectors of partial nodes are available and the graph structure is intact. The related models generally follow the tw…
Graph Clustering