提出双加权对比学习,提升多视角聚类的准确率与鲁棒性。
DWCL: Dual-Weighted Contrastive Learning for Multi-View Clustering
- 采用最优其他视角机制,降低不可靠跨视图对的影响。
- 引入视图质量与差异双重权重,缓解表示退化问题。
- 在8个数据集上优于现有方法,尤其在Caltech6V7和MSRCv1表现突出。
多视角对比聚类(MVCC)通过对比学习从多个视角生成一致的聚类结构,受到广泛关注。然而,现有大多数方法通过任意两视角组合生成跨视角对,导致大量不可靠配对。同时,这些方法常忽视多视角表示间的差异,引发表示退化。为此,本文提出一种新的多视角聚类模型——双加权对比学习(DWCL)。为减少不可靠跨视角的影响,提出创新的最优其他(B-O)对比机制,在低计算成本下增强单视角表示。进一步设计双权重策略,结合视图质量权重与视图差异权重,有效抑制低质量且高差异跨视角的负面影响。理论证明了B-O机制的有效性及双权重策略的合理性。大量实验表明,DWCL在8个多视角数据集上均优于先前方法,表现出更优性能与鲁棒性。特别地,在Caltech6V7和MSRCv1数据集上,相比当前最优方法分别取得5.4%和5.6%的绝对准确率提升。
原文摘要 · Abstract (English)
Multi-view contrastive clustering (MVCC) has gained significant attention for generating consistent clustering structures from multiple views through contrastive learning. However, most existing MVCC methods create cross-views by combining any two views, leading to a high volume of unreliable pairs. Furthermore, these approaches often overlook discrepancies in multi-view representations, resulting in representation degeneration. To address these challenges, we introduce a novel model called Dual-Weighted Contrastive Learning (DWCL) for Multi-View Clustering. Specifically, to reduce the impact of unreliable cross-views, we introduce an innovative Best-Other (B-O) contrastive mechanism that enhances the representation of individual views at a low computational cost. Furthermore, we develop a dual weighting strategy that combines a view quality weight, reflecting the quality of each view, with a view discrepancy weight. This approach effectively mitigates representation degeneration by downplaying cross-views that are both low in quality and high in discrepancy. We theoretically validate the efficiency of the B-O contrastive mechanism and the effectiveness of the dual weighting strategy. Extensive experiments demonstrate that DWCL outperforms previous methods across eight multi-view datasets, showcasing superior performance and robustness in MVCC. Specifically, our method achieves absolute accuracy improvements of 5.4\% and 5.6\% compared to state-of-the-art methods on the Caltech6V7 and MSRCv1 datasets, respectively.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。