arXivDaily arXiv每日学术速递 周一至周五更新
​通知:联邦节假日调休:哥伦布日 / 原住民日(Columbus Day / Indigenous Peoples' Day),今日(13日)无更新。
arXiv 2603.09370cs.LG

从表示到聚类:一种面向属性超图聚类的对比学习方法

From Representation to Clusters: A Contrastive Learning Approach for Attributed Hypergraph Clustering

Li Ni, Shuaikang Zeng, Lin Mu, Longlong Lin

AI总结:

本文提出了一种端到端的对比学习方法CAHC,用于属性超图聚类,通过联合嵌入和聚类优化实现节点嵌入学习与聚类结果的同步生成。

摘要:

对比学习在属性超图聚类中展现了强大的性能。通常,现有基于对比学习的方法首先学习节点嵌入,然后应用聚类算法,如k均值,对这些嵌入进行聚类以获得聚类结果。然而,这些方法缺乏直接的聚类监督,可能导致在学习图中包含与聚类无关的信息。为此,我们提出了一种面向属性超图聚类的对比学习方法(CAHC),这是一种端到端的方法,同时学习节点嵌入并获得聚类结果。CAHC包括两个主要步骤:表示学习和聚类分配学习。前者采用一种新的对比学习方法,结合节点级和超边级目标以生成节点嵌入。后者联合嵌入和聚类优化,通过聚类导向的指导来细化这些嵌入,并同时获得聚类结果。广泛的实验结果表明,CAHC在八个数据集上优于基线方法。

英文摘要:

Contrastive learning has demonstrated strong performance in attributed hypergraph clustering. Typically, existing methods based on contrastive learning first learn node embeddings and then apply clustering algorithms, such as k-means, to these embeddings to obtain the clustering results.However, these methods lack direct clustering supervision, risking the inclusion of clustering-irrelevant information in the learned graph.To this end, we propose a Contrastive learning approach for Attributed Hypergraph Clustering (CAHC), an end-to-end method that simultaneously learns node embeddings and obtains clustering results. CAHC consists of two main steps: representation learning and cluster assignment learning. The former employs a novel contrastive learning approach that incorporates both node-level and hyperedge-level objectives to generate node embeddings.The latter joint embedding and clustering optimization to refine these embeddings by clustering-oriented guidance and obtains clustering results simultaneously.Extensive experimental results demonstrate that CAHC outperforms baselines on eight datasets.

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

↑