arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.08697cs.CVcs.LG

带高置信度引导的不完整对比多视图聚类

Incomplete Contrastive Multi-View Clustering with High-Confidence Guiding

Harbin Institute of Technology(哈尔滨工业大学)

Guoqing Chao, Yi Jiang, Dianhui Chu

AI总结:

针对现有不完整多视图聚类存在的信息利用不充分、表示与聚类分离等问题,提出ICMVC方法,通过多视图一致性迁移、注意力融合与端到端联合优化提升聚类性能。

摘要:

由于存在缺失值的多视图数据在现实应用中无处不在,不完整多视图聚类成为一个重要研究问题。尽管学界已在不完整多视图聚类方面付出诸多努力,但仍存在一些挑战:1)大多数现有方法未充分利用多视图信息来处理缺失值;2)多数方法仅利用多视图数据中的一致性信息,却忽略了互补信息;3)现有不完整多视图聚类方法将不完整多视图表示学习与聚类视为独立过程,导致性能存在差距。本研究提出了一种新颖的带高置信度引导的不完整对比多视图聚类方法(ICMVC)。首先,我们提出多视图一致性关系迁移结合图卷积网络来解决缺失值问题。其次,提出实例级注意力融合与高置信度引导以挖掘互补信息,同时设计针对潜在表示的实例级对比学习来利用一致性信息。第三,提出一种端到端框架,将多视图缺失值处理、多视图表示学习与聚类分配整合以进行联合优化。与当前最优方法的对比实验证明了我们方法的有效性与优越性。我们的代码公开于https://github.com/liunian-Jay/ICMVC。

英文摘要:

Incomplete multi-view clustering becomes an important research problem, since multi-view data with missing values are ubiquitous in real-world applications. Although great efforts have been made for incomplete multi-view clustering, there are still some challenges: 1) most existing methods didn't make full use of multi-view information to deal with missing values; 2) most methods just employ the consistent information within multi-view data but ignore the complementary information; 3) For the existing incomplete multi-view clustering methods, incomplete multi-view representation learning and clustering are treated as independent processes, which leads to performance gap. In this work, we proposed a novel Incomplete Contrastive Multi-View Clustering method with high-confidence guiding (ICMVC). Firstly, we proposed a multi-view consistency relation transfer plus graph convolutional network to tackle missing values problem. Secondly, instance-level attention fusion and high-confidence guiding are proposed to exploit the complementary information while instance-level contrastive learning for latent representation is designed to employ the consistent information. Thirdly, an end-to-end framework is proposed to integrate multi-view missing values handling, multi-view representation learning and clustering assignment for joint optimization. Experiments compared with state-of-the-art approaches demonstrated the effectiveness and superiority of our method. Our code is publicly available at https://github.com/liunian-Jay/ICMVC.

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

↑