Manifold-based Incomplete Multi-view Clustering via Bi-Consistency Guidance

• URL: http://arxiv.org/abs/2405.10987v1
• Date: Thu, 16 May 2024 05:58:29 GMT
• Title: Manifold-based Incomplete Multi-view Clustering via Bi-Consistency Guidance
• Authors: Huibing Wang, Mingze Yao, Yawei Chen, Yunqiu Xu, Haipeng Liu, Wei Jia, Xianping Fu, Yang Wang,
• Abstract summary: We propose a novel method for Incomplete Multi-view clustering via Bi-consistency guidance (MIMB) MIMB flexibly recovers incomplete data among various views, and attempts to achieve biconsistency guidance via reverse regularization. We show that MIMB can significantly obtain superior results as compared with several state-of-the-art baselines.
• Score: 23.071303965962517
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Incomplete multi-view clustering primarily focuses on dividing unlabeled data into corresponding categories with missing instances, and has received intensive attention due to its superiority in real applications. Considering the influence of incomplete data, the existing methods mostly attempt to recover data by adding extra terms. However, for the unsupervised methods, a simple recovery strategy will cause errors and outlying value accumulations, which will affect the performance of the methods. Broadly, the previous methods have not taken the effectiveness of recovered instances into consideration, or cannot flexibly balance the discrepancies between recovered data and original data. To address these problems, we propose a novel method termed Manifold-based Incomplete Multi-view clustering via Bi-consistency guidance (MIMB), which flexibly recovers incomplete data among various views, and attempts to achieve biconsistency guidance via reverse regularization. In particular, MIMB adds reconstruction terms to representation learning by recovering missing instances, which dynamically examines the latent consensus representation. Moreover, to preserve the consistency information among multiple views, MIMB implements a biconsistency guidance strategy with reverse regularization of the consensus representation and proposes a manifold embedding measure for exploring the hidden structure of the recovered data. Notably, MIMB aims to balance the importance of different views, and introduces an adaptive weight term for each view. Finally, an optimization algorithm with an alternating iteration optimization strategy is designed for final clustering. Extensive experimental results on 6 benchmark datasets are provided to confirm that MIMB can significantly obtain superior results as compared with several state-of-the-art baselines.

Related papers

• 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)
• 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)
• Incomplete Multi-view Clustering via Diffusion Contrastive Generation [10.303281347345955]
  We propose a novel IMVC method called Diffusion Contrastive Generation (DCG) DCG learns the distribution characteristics to enhance clustering by applying forward diffusion and reverse denoising processes to intra-view data. It integrates instance-level and category-level interactive learning to exploit the consistent and complementary information available in multi-view data.
  arXiv  Detail & Related papers  (2025-03-12T09:27:25Z)
• Tackling Diverse Minorities in Imbalanced Classification [80.78227787608714]
  Imbalanced datasets are commonly observed in various real-world applications, presenting significant challenges in training classifiers. We propose generating synthetic samples iteratively by mixing data samples from both minority and majority classes. We demonstrate the effectiveness of our proposed framework through extensive experiments conducted on seven publicly available benchmark datasets.
  arXiv  Detail & Related papers  (2023-08-28T18:48:34Z)
• Large-scale Fully-Unsupervised Re-Identification [78.47108158030213]
  We propose two strategies to learn from large-scale unlabeled data. The first strategy performs a local neighborhood sampling to reduce the dataset size in each without violating neighborhood relationships. A second strategy leverages a novel Re-Ranking technique, which has a lower time upper bound complexity and reduces the memory complexity from O(n2) to O(kn) with k n.
  arXiv  Detail & Related papers  (2023-07-26T16:19:19Z)
• 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 Generalized Framework for Predictive Clustering and Optimization [18.06697544912383]
  Clustering is a powerful and extensively used data science tool. In this article, we define a generalized optimization framework for predictive clustering. We also present a joint optimization strategy that exploits mixed-integer linear programming (MILP) for global optimization.
  arXiv  Detail & Related papers  (2023-05-07T19:56:51Z)
• Information Recovery-Driven Deep Incomplete Multiview Clustering Network [23.67037641931882]
  In this paper, we propose an information recovery-driven deep incomplete multi-view clustering network, termed as RecFormer. A two-stage autoencoder network with the self-attention structure is built to synchronously extract high-level semantic representations of multiple views and recover the missing data. We develop a recurrent graph reconstruction mechanism that cleverly leverages the restored views to promote the representation learning and the further data reconstruction.
  arXiv  Detail & Related papers  (2023-04-02T02:36:30Z)
• Unified Multi-View Orthonormal Non-Negative Graph Based Clustering Framework [74.25493157757943]
  We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework. We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
  arXiv  Detail & Related papers  (2022-11-03T08:18:27Z)
• Rethinking Clustering-Based Pseudo-Labeling for Unsupervised Meta-Learning [146.11600461034746]
  Method for unsupervised meta-learning, CACTUs, is a clustering-based approach with pseudo-labeling. This approach is model-agnostic and can be combined with supervised algorithms to learn from unlabeled data. We prove that the core reason for this is lack of a clustering-friendly property in the embedding space.
  arXiv  Detail & Related papers  (2022-09-27T19:04:36Z)
• 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)
• Incremental Unsupervised Feature Selection for Dynamic Incomplete Multi-view Data [16.48538951608735]
  In real applications, the multi-view data are often incomplete, i.e., some views of instances are missing. We propose an Incremental Incomplete Multi-view Unsupervised Feature Selection method (I$2$MUFS) on incomplete multi-view streaming data.
  arXiv  Detail & Related papers  (2022-04-05T16:29:39Z)
• Meta Clustering Learning for Large-scale Unsupervised Person Re-identification [124.54749810371986]
  We propose a "small data for big task" paradigm dubbed Meta Clustering Learning (MCL) MCL only pseudo-labels a subset of the entire unlabeled data via clustering to save computing for the first-phase training. Our method significantly saves computational cost while achieving a comparable or even better performance compared to prior works.
  arXiv  Detail & Related papers  (2021-11-19T04:10:18Z)
• Unsupervised Multi-view Clustering by Squeezing Hybrid Knowledge from Cross View and Each View [68.88732535086338]
  This paper proposes a new multi-view clustering method, low-rank subspace multi-view clustering based on adaptive graph regularization. Experimental results for five widely used multi-view benchmarks show that our proposed algorithm surpasses other state-of-the-art methods by a clear margin.
  arXiv  Detail & Related papers  (2020-08-23T08:25:06Z)

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.