arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.03596cs.AI
收藏

面向多视图异配图聚类的相似性增强同配性方法

SiMilarity-Enhanced Homophily for Multi-View Heterophilous Graph Clustering

Virginia Polytechnic Institute and State University(弗吉尼亚理工大学);University of Electronic Science and Technology of China(电子科技大学);Shanghai AI Lab(上海人工智能实验室);Lehigh University(理海大学)

Jianpeng Chen, Yawen Ling, Yazhou Ren, Zichen Wen, Tianyi Wu, Shufei Zhang, Lifang He

AI总结:

本文提出SMHGC方法,通过三种无标签相似性项增强图同配性,并结合视图间与视图内共识融合,有效提升多视图异配图聚类性能。

摘要:

随着图结构数据的日益普及,多视图图聚类已广泛应用于各种下游任务。现有方法主要依赖统一的图消息传递机制,这显著提升了聚类性能。然而,该机制限制了其在异配场景下的适用性,因为它从根本上基于同配性假设,即相连节点通常属于同一类别。在现实中,这一假设并不总是成立;由于图中不可避免的异配信息,中等甚至轻度同配的图比完全同配的图更为常见。为解决这一问题,本文提出了一种新颖的面向多视图异配图聚类的相似性增强同配性方法(SMHGC)。通过分析相似性与图同配性之间的关系,我们提出以无标签方式引入三种相似性项来增强同配性,即邻居模式相似性、节点特征相似性和多视图全局相似性。随后,提出了一种基于共识的视图间与视图内融合范式,用于融合来自不同视图的改进同配图并将其用于聚类。在多视图异配和同配数据集上的最新实验结果共同证明了相似性在无监督多视图异配图学习中的强大能力。此外,在具有不同同配性水平的半合成数据集上的一致性能进一步证明了SMHGC对异配性的鲁棒性。

英文摘要:

With the increasing prevalence of graph-structured data, multi-view graph clustering has been widely used in various downstream applications. Existing approaches primarily rely on a unified message passing mechanism, which significantly enhances clustering performance. Nevertheless, this mechanism limits its applicability to heterophilous situations, as it is fundamentally predicated on the assumption of homophily, i.e., the connected nodes often belong to the same class. In reality, this assumption does not always hold; a moderately or even mildly homophilous graph is more common than a fully homophilous one due to inevitable heterophilous information in the graph. To address this issue, in this paper, we propose a novel SiMilarity-enhanced Homophily for Multi-view Heterophilous Graph Clustering (SMHGC) approach. By analyzing the relationship between similarity and graph homophily, we propose to enhance the homophily by introducing three similarity terms, i.e., neighbor pattern similarity, node feature similarity, and multi-view global similarity, in a label-free manner. Then, a consensus-based inter- and intra-view fusion paradigm is proposed to fuse the improved homophilous graph from different views and utilize them for clustering. The state-of-the-art experimental results on both multi-view heterophilous and homophilous datasets collectively demonstrate the strong capacity of similarity for unsupervised multi-view heterophilous graph learning. Additionally, the consistent performance across semi-synthetic datasets with varying levels of homophily serves as further evidence of SMHGC's resilience to heterophily.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑