Semantic Invariant Multi-view Clustering with Fully Incomplete Information

• URL: http://arxiv.org/abs/2305.12743v2
• Date: Thu, 21 Dec 2023 07:35:33 GMT
• Title: Semantic Invariant Multi-view Clustering with Fully Incomplete Information
• Abstract summary: We present a novel framework called SeMantic Invariance LEarning (SMILE) for multi-view clustering with incomplete information. To be specific, we discover the existence of invariant semantic distribution across different views, which enables SMILE to alleviate the cross-view discrepancy. Our approach improves the clustering accuracy of NoisyMNIST from 19.3%/23.2% to 82.7%/69.0% when the correspondences/instances are fully incomplete.
• Score: 28.321343045226772
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Robust multi-view learning with incomplete information has received significant attention due to issues such as incomplete correspondences and incomplete instances that commonly affect real-world multi-view applications. Existing approaches heavily rely on paired samples to realign or impute defective ones, but such preconditions cannot always be satisfied in practice due to the complexity of data collection and transmission. To address this problem, we present a novel framework called SeMantic Invariance LEarning (SMILE) for multi-view clustering with incomplete information that does not require any paired samples. To be specific, we discover the existence of invariant semantic distribution across different views, which enables SMILE to alleviate the cross-view discrepancy to learn consensus semantics without requiring any paired samples. The resulting consensus semantics remain unaffected by cross-view distribution shifts, making them useful for realigning/imputing defective instances and forming clusters. We demonstrate the effectiveness of SMILE through extensive comparison experiments with 13 state-of-the-art baselines on five benchmarks. Our approach improves the clustering accuracy of NoisyMNIST from 19.3\%/23.2\% to 82.7\%/69.0\% when the correspondences/instances are fully incomplete. The code could be accessed from https://pengxi.me.

Related papers

• Robust Multi-view Clustering against Imperfect Information [22.44765600975703]
  Posterior-guided Latent Counterpart Inference (PLCI) is a novel framework for tackling the imperfect information problem.<n>PLCI formulates the desired cross-view counterpart of each anchor instance as a latent variable.
  arXiv  Detail & Related papers  (2026-06-03T01:55:41Z)
• Simple Yet Effective Selective Imputation for Incomplete Multi-view Clustering [30.6002437648244]
  We propose Informativeness-based Selective imputation Multi-View Clustering (ISMVC)<n>Our method evaluates the imputation-relevant informativeness of each missing position based on intra-view similarity and cross-view consistency.<n>Compared with existing cautious imputation strategies that depend on training dynamics or model feedback, our method is lightweight, data-driven, and model-agnostic.
  arXiv  Detail & Related papers  (2025-12-11T06:22:23Z)
• Generalized Deep Multi-view Clustering via Causal Learning with Partially Aligned Cross-view Correspondence [72.41989962665285]
  Multi-view clustering (MVC) aims to explore the common clustering structure across multiple views.<n>However, real-world scenarios often present a challenge as only partial data is consistently aligned across different views.<n>We design a causal multi-view clustering network, termed CauMVC, to tackle this problem.
  arXiv  Detail & Related papers  (2025-09-19T14:31:40Z)
• Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learning [65.75756724642932]
  In incomplete multi-view clustering, missing data induce prototype shifts within views and semantic inconsistencies across views.<n>We propose an IMVC framework, imputation- and alignment-free for consensus semantics learning (FreeCSL)<n>FreeCSL achieves more confident and robust assignments on IMVC task, compared to state-of-the-art competitors.
  arXiv  Detail & Related papers  (2025-05-16T12:37:10Z)
• Deep Incomplete Multi-view Clustering with Distribution Dual-Consistency Recovery Guidance [69.58609684008964]
  We propose BURG, a novel method for incomplete multi-view clustering with distriBution dUal-consistency Recovery Guidance. We treat each sample as a distinct category and perform cross-view distribution transfer to predict the distribution space of missing views. To compensate for the lack of reliable category information, we design a dual-consistency guided recovery strategy that includes intra-view alignment guided by neighbor-aware consistency and cross-view alignment guided by prototypical consistency.
  arXiv  Detail & Related papers  (2025-03-14T02:27:45Z)
• Deep Incomplete Multi-view Learning via Cyclic Permutation of VAEs [17.28020972971443]
  We propose Multi-View Permutation of Variational Auto-Encoders (MVP), which excavates invariant relationships between views in incomplete data. MVP establishes inter-view correspondences in the latent space of Variational Auto-Encoders, enabling the inference of missing views. We demonstrate the effectiveness of our approach on seven diverse datasets with varying missing ratios.
  arXiv  Detail & Related papers  (2025-02-16T08:36:43Z)
• Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation [63.180725016463974]
  Cross-modal retrieval relies on well-matched large-scale datasets that are laborious in practice. We introduce a novel noisy correspondence learning framework, namely textbfSelf-textbfReinforcing textbfErrors textbfMitigation (SREM)
  arXiv  Detail & Related papers  (2023-12-27T09:03:43Z)
• Incomplete Contrastive Multi-View Clustering with High-Confidence Guiding [7.305817202715752]
  We propose 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.
  arXiv  Detail & Related papers  (2023-12-14T07:28:41Z)
• Virtual Category Learning: A Semi-Supervised Learning Method for Dense Prediction with Extremely Limited Labels [63.16824565919966]
  This paper proposes to use confusing samples proactively without label correction. A Virtual Category (VC) is assigned to each confusing sample in such a way that it can safely contribute to the model optimisation. Our intriguing findings highlight the usage of VC learning in dense vision tasks.
  arXiv  Detail & Related papers  (2023-12-02T16:23:52Z)
• Scalable Incomplete Multi-View Clustering with Structure Alignment [71.62781659121092]
  In this paper, we propose a novel incomplete anchor graph learning framework. We construct the view-specific anchor graph to capture the complementary information from different views. The time and space complexity of the proposed SIMVC-SA is proven to be linearly correlated with the number of samples.
  arXiv  Detail & Related papers  (2023-08-31T08:30:26Z)
• Deep Incomplete Multi-view Clustering with Cross-view Partial Sample and Prototype Alignment [50.82982601256481]
  We propose a Cross-view Partial Sample and Prototype Alignment Network (CPSPAN) for Deep Incomplete Multi-view Clustering. Unlike existing contrastive-based methods, we adopt pair-observed data alignment as 'proxy supervised signals' to guide instance-to-instance correspondence construction.
  arXiv  Detail & Related papers  (2023-03-28T02:31:57Z)
• Self-supervised Image Clustering from Multiple Incomplete Views via Constrastive Complementary Generation [5.314364096882052]
  We propose Contrastive Incomplete Multi-View Image Clustering with Generative Adversarial Networks (CIMIC-GAN) We incorporate autoencoding representation of complete and incomplete data into double contrastive learning to achieve learning consistency. Experiments conducted on textcolorblackfour extensively-used datasets show that CIMIC-GAN outperforms state-of-the-art incomplete multi-View clustering methods.
  arXiv  Detail & Related papers  (2022-09-24T05:08:34Z)
• Localized Sparse Incomplete Multi-view Clustering [22.009806900278786]
  This paper proposes a simple but effective method, named localized sparse incomplete multi-view clustering (LSIMVC) To tackle these problems, this paper proposes a simple but effective method, named localized sparse incomplete multi-view clustering (LSIMVC)
  arXiv  Detail & Related papers  (2022-08-05T05:48:28Z)
• Optimal Clustering with Bandit Feedback [57.672609011609886]
  This paper considers the problem of online clustering with bandit feedback. It includes a novel stopping rule for sequential testing that circumvents the need to solve any NP-hard weighted clustering problem as its subroutines. We show through extensive simulations on synthetic and real-world datasets that BOC's performance matches the lower boundally, and significantly outperforms a non-adaptive baseline algorithm.
  arXiv  Detail & Related papers  (2022-02-09T06:05:05Z)
• Leveraging Ensembles and Self-Supervised Learning for Fully-Unsupervised Person Re-Identification and Text Authorship Attribution [77.85461690214551]
  Learning from fully-unlabeled data is challenging in Multimedia Forensics problems, such as Person Re-Identification and Text Authorship Attribution. Recent self-supervised learning methods have shown to be effective when dealing with fully-unlabeled data in cases where the underlying classes have significant semantic differences. We propose a strategy to tackle Person Re-Identification and Text Authorship Attribution by enabling learning from unlabeled data even when samples from different classes are not prominently diverse.
  arXiv  Detail & Related papers  (2022-02-07T13:08:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.