Non-Linear Fusion for Self-Paced Multi-View Clustering
Not on the map. Why?
Abstract (arXiv)
With the advance of the multi-media and multi-modal data, multi-view clustering (MVC) has drawn increasing attentions recently. In this field, one of the most crucial challenges is that the characteristics and qualities of different views usually vary extensively. Therefore, it is essential for MVC methods to find an effective approach that handles the diversity of multiple views appropriately. To this end, a series of MVC methods focusing on how to integrate the loss from each view have been proposed in the past few years. Among these methods, the mainstream idea is assigning weights to each view and then combining them linearly. In this paper, inspired by the effectiveness of non-linear combination in instance learning and the auto-weighted approaches, we propose Non-Linear Fusion for Self-Paced Multi-View Clustering (NSMVC), which is totally different from the the conventional linear-weighting algorithms. In NSMVC, we directly assign different exponents to different views according to their qualities. By this way, the negative impact from the corrupt views can be significantly reduced. Meanwhile, to address the non-convex issue of the MVC model, we further define a novel regularizer-free modality of Self-Paced Learning (SPL), which fits the proposed non-linear model perfectly. Experimental results on various real-world data sets demonstrate the effectiveness of the proposed method.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 2 of its 41 references that are in the map. First posted on arXiv 19 Apr 2021.
Builds on
2 of 41 references.
References · 2
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 3; 2025: 1.
9 papers.
- 2022Deep Clustering: A Comprehensive Surveycited by 78
- 2022Adaptively-weighted Integral Space for Fast Multiview Clusteringcited by 9
- 2022Variational Graph Generator for Multi-View Graph Clusteringcited by 7
- 2024Dual-Optimized Adaptive Graph Reconstruction for Multi-View Graph Clusteringcited by 1
- 2025Adaptive and Robust DBSCAN with Multi-agent Reinforcement Learningcited by 1
- 2021Self-Paced Deep Regression Forests with Consideration of Ranking Fairnesscited by 0
- 2023Self-Paced Neutral Expression-Disentangled Learning for Facial Expression Recognitioncited by 0
- 2024Bridging Gaps: Federated Multi-View Clustering in Heterogeneous Hybrid Viewscited by 0
- 2024Anchor Learning with Potential Cluster Constraints for Multi-view Clusteringcited by 0
- 2025Adaptive and Robust DBSCAN with Multi-agent Reinforcement Learning7 May 2025
- 2024Anchor Learning with Potential Cluster Constraints for Multi-view Clustering21 Dec 2024
- 2024Dual-Optimized Adaptive Graph Reconstruction for Multi-View Graph Clustering30 Oct 2024
- 2024Bridging Gaps: Federated Multi-View Clustering in Heterogeneous Hybrid Views12 Oct 2024
- 2023Self-Paced Neutral Expression-Disentangled Learning for Facial Expression Recognition21 Mar 2023
- 2022Variational Graph Generator for Multi-View Graph Clustering13 Oct 2022
- 2022Deep Clustering: A Comprehensive Survey9 Oct 2022
- 2022Adaptively-weighted Integral Space for Fast Multiview Clustering25 Aug 2022
- 2021Self-Paced Deep Regression Forests with Consideration of Ranking Fairness13 Dec 2021