ECMVC: Entropy-aware Curriculum-guided Multi-view Contrastive Clustering

Multi-view clustering aims to integrate complementary information from multiple views to achieve better performance than single-view clustering. However, in practical scenarios, the quality of each view is often inconsistent, with some views containing substantial noise or redundant information, which may adversely affect the overall clustering performance. Moreover, existing contrastive learning techniques typically employ overly simplistic strategies for negative sample selection, making them prone to local optima during training and compromising model effectiveness. To address these challenges, this paper proposes a novel information fusion-based deep multi-view contrastive clustering algorithm, termed ECMVC. The proposed method explicitly models both consistency and complementarity among views and leverages a feature fusion network to enhance the stability and accuracy of clustering in noisy and redundant environments. In addition, we further propose a curriculum-guided contrastive learning approach, where an entropy-driven dynamic scheduler adaptively selects informative negative samples and progressively increases the training difficulty. This curriculum-guided mechanism enables faster convergence and more stable optimization. Experiments on multiple benchmark datasets demonstrate the effectiveness of the proposed method.

Authors

Institutions

Publication Details

Journal
Neural Processing Letters
Published
2026-04-11
DOI
https://doi.org/10.1007/s11063-026-11848-z
Primary Topic
Domain Adaptation and Few-Shot Learning
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ECMVC: Entropy-aware Curriculum-guided Multi-view Contrastive Clustering

Yuquan Shao, Jun Ma, Yangyang Zhou, Wenjing Jia
Neural Processing Letters
Domain Adaptation and Few-Shot Learning
article

ECMVC: Entropy-aware Curriculum-guided Multi-view Contrastive Clustering

Yuquan Shao, Jun Ma, Yangyang Zhou, Wenjing Jia
article en

Abstract

Multi-view clustering aims to integrate complementary information from multiple views to achieve better performance than single-view clustering. However, in practical scenarios, the quality of each view is often inconsistent, with some views containing substantial noise or redundant information, which may adversely affect the overall clustering performance. Moreover, existing contrastive learning techniques typically employ overly simplistic strategies for negative sample selection, making them prone to local optima during training and compromising model effectiveness. To address these challenges, this paper proposes a novel information fusion-based deep multi-view contrastive clustering algorithm, termed ECMVC. The proposed method explicitly models both consistency and complementarity among views and leverages a feature fusion network to enhance the stability and accuracy of clustering in noisy and redundant environments. In addition, we further propose a curriculum-guided contrastive learning approach, where an entropy-driven dynamic scheduler adaptively selects informative negative samples and progressively increases the training difficulty. This curriculum-guided mechanism enables faster convergence and more stable optimization. Experiments on multiple benchmark datasets demonstrate the effectiveness of the proposed method.

Neural Processing Letters
Northwest Minzu University (CN), Minzu University of China (CN), Beijing Technology and Business University (CN)
Quality Education
Openalex Percentile: Top 5%
Domain Adaptation and Few-Shot Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.