arXiv:2412.09902cs.LGcs.AI2024-12中稿 · AAAI被引 20

为每个节点定制模型,用特征自适应提升图聚类效果

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

  • 为每个节点构建专属模型,动态筛选关键特征
  • 在多个数据集上超越现有最佳方法,最高提升12.3%
  • 可无缝接入GNN模型,适合想优化特征利用的开发者

现有图聚类方法多关注拓扑结构,忽视了“缺失的一半”节点特征信息,尤其在高维特征下更难有效利用。特征选择困难在于需同时发现簇并识别相关特征。为此,本文提出“一个节点一个模型”的新范式,为每个节点构建专属模型,并将节点标签定义为对节点组预测的组合。提出的“特征个性化图聚类(FPGC)”方法使用压缩-激励模块为每个节点识别相关特征,将其融入模型生成最终表示。此外,引入特征交叉作为数据增强技术,学习低阶特征交互。大量实验表明,FPGC显著优于现有最优方法。该方法具有即插即用特性,能从特征角度提升基于GNN的模型性能。

原文摘要 · Abstract (English)

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.

图聚类特征选择GNN

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。