Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.09902 v2 pith:3OOJHSYS submitted 2024-12-13 cs.LG cs.AIcs.DCcs.SI

classification cs.LGcs.AIcs.DCcs.SI
keywords nodeclusteringfeaturefeaturesgraphmodelclustersenhance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 a feature perspective.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On the Benefits of Attribute-Driven Graph Domain Adaptation

    cs.LG 2025-02 reject novelty 3.0 of 10

    The paper claims node attribute shift matters more than topology shift in graph domain adaptation, but the proof and loss formulation contain critical errors.

Pith tools