Smoothness-Induced Efficient Incomplete Multi-View Clustering
- 28 July 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (10) , 6173-6188
Abstract
Efficient incomplete multi-view clustering has received increasing attention due to its ability to handle large-scale and missing data. Although existing methods have promising performance, 1) they typically generate anchors directly from incomplete and noisy raw data, resulting in uncomprehensive anchor coverage and unreliable results; 2) they typically use only sparse regularization to remove noise and overlook outliers; 3) they ignore the inherent consistency of features in a view. To address these issues, we propose a smoothness-induced efficient incomplete multi-view clustering (SEIC) method. SEIC regards available data as natural anchors selected from complete data, and performs matrix decomposition only on them to obtain reliable small-size representation matrices. View-specific representation matrices are constructed as a tensor to capture consensus and guide matrix decomposition. More significantly, we enforce both smoothness and low-rank coupling on the tensor. Smoothness induces continuous variation of the tensor to further eliminate noise and enhance the relation among features. Benefiting from the noise robustness of SEIC, we design an adaptive noise balance parameter that renders SEIC parameter-free. Furthermore, by constructing a sparse anchor graph on the learned tensor, we propose the spectral clustering version SEIC-SC. Experiments on multiple datasets demonstrate the superior performance and efficiency of SEIC and SEIC-SC.Keywords
Funding Information
- KR&DP of Guangxi (GuiKeAD25069071)
- National Natural Science Foundation of China (62261003, 62201160, 62361003)
- Natural Science Foundation of Guangxi Province (2024JJA170151)
- Innovation Project of Guangxi Graduate Education (YCBZ2025011)
This publication has 62 references indexed in Scilit:
- Triplets-based large-scale multi-view spectral clusteringInformation Fusion, 2025
- View-specific anchors coupled tensorial bipartite graph learning for incomplete multi-view clusteringInformation Sciences, 2024
- Scalable incomplete multi-view clustering with adaptive data completionInformation Sciences, 2023
- Scalable incomplete multi-view clustering via tensor Schatten p-norm and tensorized bipartite graphEngineering Applications of Artificial Intelligence, 2023
- Cluster Contrast for Unsupervised Person Re-identification2023
- Auto-weighted sample-level fusion with anchors for incomplete multi-view clusteringPattern Recognition, 2022
- Efficient correntropy-based multi-view clustering with anchor graph embeddingNeural Networks, 2022
- Novel fuzzy clustering algorithm with variable multi-pixel fitting spatial information for image segmentationPattern Recognition, 2022
- On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank MinimizationInternational Journal of Computer Vision, 2018
- Nonlinear total variation based noise removal algorithmsPhysica D: Nonlinear Phenomena, 1992