Refining Graph Structure for Incomplete Multi-View Clustering
- 15 July 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (2) , 2300-2313
Abstract
As a challenging problem, incomplete multi-view clustering (MVC) has drawn much attention in recent years. Most of the existing methods contain the feature recovering step inevitably to obtain the clustering result of incomplete multi-view datasets. The extra target of recovering the missing feature in the original data space or common subspace is difficult for unsupervised clustering tasks and could accumulate mistakes during the optimization. Moreover, the biased error is not taken into consideration in the previous graph-based methods. The biased error represents the unexpected change of incomplete graph structure, such as the increase in the intra-class relation density and the missing local graph structure of boundary instances. It would mislead those graph-based methods and degrade their final performance. In order to overcome these drawbacks, we propose a new graph-based method named Graph Structure Refining for Incomplete MVC (GSRIMC). GSRIMC avoids recovering feature steps and just fully explores the existing subgraphs of each view to produce superior clustering results. To handle the biased error, the biased error separation is the core step of GSRIMC. In detail, GSRIMC first extracts basic information from the precomputed subgraph of each view and then separates refined graph structure from biased error with the help of tensor nuclear norm. Besides, cross-view graph learning is proposed to capture the missing local graph structure and complete the refined graph structure based on the complementary principle. Extensive experiments show that our method achieves better performance than other state-of-the-art baselines.Keywords
Funding Information
- National Key Research and Development Program of China (2021YFF1201200)
- NSFC (61876193)
- Guangdong Province Key Laboratory of Computational Science, Sun Yat-sen University (2020B1212060032)
This publication has 50 references indexed in Scilit:
- On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank MinimizationInternational Journal of Computer Vision, 2018
- Graph Learning for Multiview ClusteringIEEE Transactions on Cybernetics, 2017
- Auto-Weighted Multi-View Learning for Image Clustering and Semi-Supervised ClassificationIEEE Transactions on Image Processing, 2017
- Multiple Incomplete Views Clustering via Weighted Nonnegative Matrix Factorization with $L_{2,1}$ Regularization2015
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergentMathematical Programming, 2014
- Novel Methods for Multilinear Data Completion and De-noising Based on Tensor-SVD2014
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed TomographyIEEE Transactions on Image Processing, 2014
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in ImagingSIAM Journal on Matrix Analysis and Applications, 2013
- Robust Recovery of Subspace Structures by Low-Rank RepresentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- A tutorial on spectral clusteringStatistics and Computing, 2007