Unified and Tensorized Incomplete Multi-View Kernel Subspace Clustering
- 30 January 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 8 (2) , 1550-1566
Abstract
Incomplete multi-view clustering (IMC) has recently received widespread attention in the field of clustering analysis. In spite of the great success, we observe that the current IMC approaches are still faced with three common demerits. First, they mostly fail to recover the inherent (especially nonlinear) subspace structure during incomplete clustering procedure. Second, these approaches tend to design the objective function by some specific matrix norms, yet often overlook the high-level correlation embedded in heterogeneous views. Third, many of them follow a two-stage framework, which inevitably leads to the sub-optimal clustering result due to the lack of the ability of joint optimization. To overcome these demerits, we develop a novel approach termed Unified and Tensorized Incomplete Multi-view Kernel Subspace Clustering (UT-IMKSC) in this paper. Specifically, a kernelized incomplete subspace clustering framework is formulated to exploit the inherent subspace structure from multiple views. In this framework, we aim to impute the incomplete kernels and perform incomplete subspace clustering simultaneously, upon which the low-rank tensor representations as well as their affinity matrix can be seamlessly achieved in a one-step manner. This unified formulation enables our approach to recover the latent relationship among observed and unobserved samples, while capturing the high-level correlation for strengthened subspace clustering. To the best of our knowledge, our approach is the first attempt to formulate incomplete multi-view kernel subspace clustering from unified and tensorized perspectives. Extensive experiments are conducted on various incomplete multi-view datasets, which have demonstrated the superiority of our approach over the state-of-the-art.Keywords
Funding Information
- National Natural Science Foundation of China (62206099, 62276277)
- Basic and Applied Basic Research Foundation of Guangdong Province (2022B1515120059)
- Science and Technology Program of Guangzhou, China (2024A04J4451)
- Guangdong Provincial Key Laboratory of Intellectual Property and Big Data (2018B030322016)
This publication has 61 references indexed in Scilit:
- Seeking commonness and inconsistencies: A jointly smoothed approach to multi-view subspace clusteringInformation Fusion, 2022
- Representation Learning in Multi-view Clustering: A Literature ReviewData Science and Engineering, 2022
- A novel consensus learning approach to incomplete multi-view clusteringPattern Recognition, 2021
- Joint representation learning for multi-view subspace clusteringExpert Systems with Applications, 2021
- Partition level multiview subspace clusteringNeural Networks, 2020
- One-step Kernel Multi-view Subspace ClusteringKnowledge-Based Systems, 2020
- Multi-view intact space clusteringPattern Recognition, 2019
- On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank MinimizationInternational Journal of Computer Vision, 2018
- Multiple Incomplete Views Clustering via Weighted Nonnegative Matrix Factorization with $L_{2,1}$ Regularization2015
- Factorization strategies for third-order tensorsLinear Algebra and its Applications, 2011