Unbalanced Incomplete Multi-view Clustering via the Scheme of View Evolution: Weak Views are Meat; Strong Views do Eat

• URL: http://arxiv.org/abs/2011.10254v2
• Date: Fri, 30 Apr 2021 08:51:46 GMT
• Title: Unbalanced Incomplete Multi-view Clustering via the Scheme of View Evolution: Weak Views are Meat; Strong Views do Eat
• Authors: Xiang Fang, Yuchong Hu, Pan Zhou, and Dapeng Oliver Wu
• Abstract summary: Unbalanced Incomplete Multi-view Clustering method (UIMC) is first effective method based on view evolution for unbalanced incomplete multi-view clustering. UIMC improves the clustering performance by up to 40% on three evaluation metrics over other state-of-the-art methods.
• Score: 59.77141155608009
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Incomplete multi-view clustering is an important technique to deal with real-world incomplete multi-view data. Previous works assume that all views have the same incompleteness, i.e., balanced incompleteness. However, different views often have distinct incompleteness, i.e., unbalanced incompleteness, which results in strong views (low-incompleteness views) and weak views (high-incompleteness views). The unbalanced incompleteness prevents us from directly using the previous methods for clustering. In this paper, inspired by the effective biological evolution theory, we design the novel scheme of view evolution to cluster strong and weak views. Moreover, we propose an Unbalanced Incomplete Multi-view Clustering method (UIMC), which is the first effective method based on view evolution for unbalanced incomplete multi-view clustering. Compared with previous methods, UIMC has two unique advantages: 1) it proposes weighted multi-view subspace clustering to integrate these unbalanced incomplete views, which effectively solves the unbalanced incomplete multi-view problem; 2) it designs the low-rank and robust representation to recover the data, which diminishes the impact of the incompleteness and noises. Extensive experimental results demonstrate that UIMC improves the clustering performance by up to 40% on three evaluation metrics over other state-of-the-art methods.

Related papers

• PROTOCOL: Partial Optimal Transport-enhanced Contrastive Learning for Imbalanced Multi-view Clustering [45.7495319490544]
  We present the first systematic study of imbalanced multi-view clustering.<n>We propose PROTOCOL, a novel PaRtial Optimal TranspOrt-enhanced COntrastive Learning framework.<n>We show that PROTOCOL significantly improves clustering performance on imbalanced multi-view data.
  arXiv  Detail & Related papers  (2025-06-14T08:58:14Z)
• 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)
• DealMVC: Dual Contrastive Calibration for Multi-view Clustering [78.54355167448614]
  We propose a novel Dual contrastive calibration network for Multi-View Clustering (DealMVC) We first design a fusion mechanism to obtain a global cross-view feature. Then, a global contrastive calibration loss is proposed by aligning the view feature similarity graph and the high-confidence pseudo-label graph. During the training procedure, the interacted cross-view feature is jointly optimized at both local and global levels.
  arXiv  Detail & Related papers  (2023-08-17T14:14:28Z)
• 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)
• Adaptively-weighted Integral Space for Fast Multiview Clustering [54.177846260063966]
  We propose an Adaptively-weighted Integral Space for Fast Multiview Clustering (AIMC) with nearly linear complexity. Specifically, view generation models are designed to reconstruct the view observations from the latent integral space. Experiments conducted on several realworld datasets confirm the superiority of the proposed AIMC method.
  arXiv  Detail & Related papers  (2022-08-25T05:47:39Z)
• C$^{2}$IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection [12.340714611533418]
  Multi-view unsupervised feature selection (MUFS) has been demonstrated as an effective technique to reduce the dimensionality of unlabeled data. We propose a complementary and consensus learning-based incomplete multi-view unsupervised feature selection method (C$2$IMUFS) to address the aforementioned issues. C$2$IMUFS integrates feature selection into an extended weighted non-negative matrix factorization model equipped with adaptive learning of view-weights and a sparse $ell_2,p$-norm.
  arXiv  Detail & Related papers  (2022-08-20T19:39:17Z)
• 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)
• Error-Robust Multi-View Clustering: Progress, Challenges and Opportunities [67.54503077766171]
  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.
  arXiv  Detail & Related papers  (2021-05-07T04:03:02Z)
• V3H: View Variation and View Heredity for Incomplete Multi-view Clustering [65.29597317608844]
  Incomplete multi-view clustering is an effective method to integrate these incomplete views. We propose a novel View Variation and View Heredity approach (V3H) to overcome this limitation. V3H presents possibly the first work to introduce genetics to clustering algorithms for learning simultaneously the consistent information and the unique information from incomplete multi-view data.
  arXiv  Detail & Related papers  (2020-11-23T03:24:48Z)

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.