mlsanityData to 7 Oct 2026

Deep Multi-View Semi-Supervised Clustering with Sample Pairwise Constraints

arXiv 2206.04949 ↗First posted 10 Jun 2022cs.CV cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Multi-view clustering has attracted much attention thanks to the capacity of multi-source information integration. Although numerous advanced methods have been proposed in past decades, most of them generally overlook the significance of weakly-supervised information and fail to preserve the feature properties of multiple views, thus resulting in unsatisfactory clustering performance. To address these issues, in this paper, we propose a novel Deep Multi-view Semi-supervised Clustering (DMSC) method, which jointly optimizes three kinds of losses during networks finetuning, including multi-view clustering loss, semi-supervised pairwise constraint loss and multiple autoencoders reconstruction loss. Specifically, a KL divergence based multi-view clustering loss is imposed on the common representation of multi-view data to perform heterogeneous feature optimization, multi-view weighting and clustering prediction simultaneously. Then, we innovatively propose to integrate pairwise constraints into the process of multi-view clustering by enforcing the learned multi-view representation of must-link samples (cannot-link samples) to be similar (dissimilar), such that the formed clustering architecture can be more credible. Moreover, unlike existing rivals that only preserve the encoders for each heterogeneous branch during networks finetuning, we further propose to tune the intact autoencoders frame that contains both encoders and decoders. In this way, the issue of serious corruption of view-specific and view-shared feature space could be alleviated, making the whole training procedure more stable. Through comprehensive experiments on eight popular image datasets, we demonstrate that our proposed approach performs better than the state-of-the-art multi-view and single-view competitors.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 63 references that are in the map. First posted on arXiv 10 Jun 2022.

Builds on

13 of 63 references.

References · 13

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
  3. 2016Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clusteringcited by 237
  4. 2016On Deep Multi-View Representation Learning: Objectives and Optimizationcited by 162
  5. 2020Structural Deep Clustering Networkcited by 145
  6. 2018Deep k-Means: Jointly clustering with k-Means and learning representationscited by 50
  7. 2017Deep Generalized Canonical Correlation Analysiscited by 32
  8. 2017Discriminatively Boosted Image Clustering with Fully Convolutional Auto-Encoderscited by 32
  9. 2020Deep Embedded Multi-view Clustering with Collaborative Trainingcited by 31
  10. 2018Deep Density-based Image Clusteringcited by 28
  11. 2013Semi-supervised clustering methodscited by 18
  12. 2017Face Clustering: Representation and Pairwise Constraintscited by 14
1 more
  1. 2021Fuzzy Discriminant Clustering with Fuzzy Pairwise Constraintscited by 3

Built on by

Not cited yet.