Joint Tensor and Inter-View Low-Rank Recovery for Incomplete Multiview Clustering

• URL: http://arxiv.org/abs/2503.02449v1
• Date: Tue, 04 Mar 2025 09:50:59 GMT
• Title: Joint Tensor and Inter-View Low-Rank Recovery for Incomplete Multiview Clustering
• Authors: Jianyu Wang, Zhengqiao Zhao, Nicolas Dobigeon, Jingdong Chen,
• Abstract summary: This paper proposes a novel joint tensor and inter-view low-rank Recovery (JTIV-LRR) for incomplete multiview clustering.<n>It achieves significant improvements in clustering accuracy and robustness compared to state-of-the-art methods.
• Score: 35.261304932451544
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Incomplete multiview clustering (IMVC) has gained significant attention for its effectiveness in handling missing sample challenges across various views in real-world multiview clustering applications. Most IMVC approaches tackle this problem by either learning consensus representations from available views or reconstructing missing samples using the underlying manifold structure. However, the reconstruction of learned similarity graph tensor in prior studies only exploits the low-tubal-rank information, neglecting the exploration of inter-view correlations. This paper propose a novel joint tensor and inter-view low-rank Recovery (JTIV-LRR), framing IMVC as a joint optimization problem that integrates incomplete similarity graph learning and tensor representation recovery. By leveraging both intra-view and inter-view low rank information, the method achieves robust estimation of the complete similarity graph tensor through sparse noise removal and low-tubal-rank constraints along different modes. Extensive experiments on both synthetic and real-world datasets demonstrate the superiority of the proposed approach, achieving significant improvements in clustering accuracy and robustness compared to state-of-the-art methods.

Related papers

• 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)
• Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective [52.662463893268225]
  Self-supervised heterogeneous graph learning (SHGL) has shown promising potential in diverse scenarios.<n>Existing SHGL methods encounter two significant limitations.<n>We introduce a novel framework enhanced by rank and dual consistency constraints.
  arXiv  Detail & Related papers  (2024-12-01T09:33:20Z)
• Partial Multi-View Clustering via Meta-Learning and Contrastive Feature Alignment [13.511433241138702]
  Partial multi-view clustering (PVC) presents significant challenges practical research problem for data analysis in real-world applications. Existing clustering methods struggle to handle incomplete views effectively, leading to suboptimal clustering performance. We propose a novel dual optimization framework based on contrastive learning, which aims to maximize the consistency of latent features in incomplete multi-view data.
  arXiv  Detail & Related papers  (2024-11-14T19:16:01Z)
• URRL-IMVC: Unified and Robust Representation Learning for Incomplete Multi-View Clustering [28.776476995363048]
  We propose a novel Unified and Representation Learning for Incomplete Multi-View Clustering (URRL-IMVC) URRL-IMVC directly learns a unified embedding that is robust to view missing conditions by integrating information from multiple views and neighboring samples. We extensively evaluate the proposed URRL-IMVC framework on various benchmark datasets, demonstrating its state-of-the-art performance.
  arXiv  Detail & Related papers  (2024-07-12T09:35:25Z)
• SLRL: Structured Latent Representation Learning for Multi-view Clustering [24.333292079699554]
  Multi-View Clustering (MVC) aims to exploit the inherent consistency and complementarity among different views to improve clustering outcomes. Despite extensive research in MVC, most existing methods focus predominantly on harnessing complementary information across views to enhance clustering effectiveness. We introduce a novel framework, termed Structured Latent Representation Learning based Multi-View Clustering method.
  arXiv  Detail & Related papers  (2024-07-11T09:43:57Z)
• 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)
• Latent Heterogeneous Graph Network for Incomplete Multi-View Learning [57.49776938934186]
  We propose a novel Latent Heterogeneous Graph Network (LHGN) for incomplete multi-view learning. By learning a unified latent representation, a trade-off between consistency and complementarity among different views is implicitly realized. To avoid any inconsistencies between training and test phase, a transductive learning technique is applied based on graph learning for classification tasks.
  arXiv  Detail & Related papers  (2022-08-29T15:14:21Z)
• 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)
• ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial Multi-View Clustering [52.491074276133325]
  We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering. The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
  arXiv  Detail & Related papers  (2022-03-01T02:32:25Z)
• Incomplete Multi-view Clustering via Cross-view Relation Transfer [41.17336912278538]
  We propose a novel incomplete multi-view clustering framework, which incorporates cross-view relation transfer and multi-view fusion learning. Experiments conducted on several real datasets demonstrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2021-12-01T14:28:15Z)

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.