Error-Robust Multi-View Clustering: Progress, Challenges and Opportunities

• URL: http://arxiv.org/abs/2105.03058v1
• Date: Fri, 7 May 2021 04:03:02 GMT
• Title: Error-Robust Multi-View Clustering: Progress, Challenges and Opportunities
• Authors: Mehrnaz Najafi and Lifang He and Philip S. Yu
• Abstract summary: Since label information is often expensive to acquire, multi-view clustering has gained growing interest. Error-robust multi-view clustering approaches with explicit error removal formulation can be structured into five broad research categories. This survey summarizes and reviews recent advances in error-robust clustering for multi-view data.
• Score: 67.54503077766171
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With recent advances in data collection from multiple sources, multi-view data has received significant attention. In multi-view data, each view represents a different perspective of data. Since label information is often expensive to acquire, multi-view clustering has gained growing interest, which aims to obtain better clustering solution by exploiting complementary and consistent information across all views rather than only using an individual view. Due to inevitable sensor failures, data in each view may contain error. Error often exhibits as noise or feature-specific corruptions or outliers. Multi-view data may contain any or combination of these error types. Blindly clustering multi-view data i.e., without considering possible error in view(s) could significantly degrade the performance. The goal of error-robust multi-view clustering is to obtain useful outcome even if the multi-view data is corrupted. Existing error-robust multi-view clustering approaches with explicit error removal formulation can be structured into five broad research categories - sparsity norm based approaches, graph based methods, subspace based learning approaches, deep learning based methods and hybrid approaches, this survey summarizes and reviews recent advances in error-robust clustering for multi-view data. Finally, we highlight the challenges and provide future research opportunities.

Related papers

• Regularized Contrastive Partial Multi-view Outlier Detection [76.77036536484114]
  We propose a novel method named Regularized Contrastive Partial Multi-view Outlier Detection (RCPMOD) In this framework, we utilize contrastive learning to learn view-consistent information and distinguish outliers by the degree of consistency. Experimental results on four benchmark datasets demonstrate that our proposed approach could outperform state-of-the-art competitors.
  arXiv  Detail & Related papers  (2024-08-02T14:34:27Z)
• CDIMC-net: Cognitive Deep Incomplete Multi-view Clustering Network [53.72046586512026]
  We propose a novel incomplete multi-view clustering network, called Cognitive Deep Incomplete Multi-view Clustering Network (CDIMC-net) It captures the high-level features and local structure of each view by incorporating the view-specific deep encoders and graph embedding strategy into a framework. Based on the human cognition, i.e., learning from easy to hard, it introduces a self-paced strategy to select the most confident samples for model training.
  arXiv  Detail & Related papers  (2024-03-28T15:45:03Z)
• 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)
• Hierarchical Mutual Information Analysis: Towards Multi-view Clustering in The Wild [9.380271109354474]
  This work proposes a deep MVC framework where data recovery and alignment are fused in a hierarchically consistent way to maximize the mutual information among different views. To the best of our knowledge, this could be the first successful attempt to handle the missing and unaligned data problem separately with different learning paradigms.
  arXiv  Detail & Related papers  (2023-10-28T06:43:57Z)
• 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)
• Unpaired Multi-View Graph Clustering with Cross-View Structure Matching [39.310384044597065]
  Most existing MVC methods assume that multi-view data are fully paired, which means that the mappings of all corresponding samples between views are pre-defined or given in advance. The data correspondence is often incomplete in real-world applications due to data corruption or sensor differences. We propose a novel parameter-free graph clustering framework termed Unpaired Multi-view Graph Clustering framework with Cross-View Structure Matching.
  arXiv  Detail & Related papers  (2023-07-07T09:29:44Z)
• Incomplete Multi-view Clustering via Diffusion Completion [0.0]
  We propose diffusion completion to recover the missing views integrated into an incomplete multi-view clustering framework. Based on the observable views information, the diffusion model is used to recover the missing views. The proposed method performs well in recovering the missing views while achieving superior clustering performance compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-05-19T07:39:24Z)
• A Survey on Incomplete Multi-view Clustering [66.50475816827208]
  In practical applications, such as disease diagnosis, multimedia analysis, and recommendation system, not all views of samples are available in many cases. Incomplete multi-view clustering is referred to as incomplete multi-view clustering.
  arXiv  Detail & Related papers  (2022-08-17T03:00:59Z)
• Consistency-aware and Inconsistency-aware Graph-based Multi-view Clustering [20.661025590877774]
  Graph-based multi-view clustering (GMVC) achieves state-of-the-art performance by leveraging a shared graph matrix called the unified matrix. This paper proposes a new GMVC method that incorporates consistent and inconsistent parts lying across multiple views. Numerical evaluations of real-world datasets demonstrate the effectiveness of the proposed CI-GMVC.
  arXiv  Detail & Related papers  (2020-11-25T06:00:42Z)
• Generative Partial Multi-View Clustering [133.36721417531734]
  We propose a generative partial multi-view clustering model, named as GP-MVC, to address the incomplete multi-view problem. First, multi-view encoder networks are trained to learn common low-dimensional representations, followed by a clustering layer to capture the consistent cluster structure across multiple views. Second, view-specific generative adversarial networks are developed to generate the missing data of one view conditioning on the shared representation given by other views.
  arXiv  Detail & Related papers  (2020-03-29T17:48:27Z)

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.