One-step Multi-view Clustering With Adaptive Low-rank Anchor-graph Learning
Preprint
Abstract
In light of their capability to capture structural information while reducing computing complexity, anchor graph-based multi-view clustering (AGMC) methods have attracted considerable attention in large-scale clustering problems. Nevertheless, existing AGMC methods still face the following two issues: 1) They directly embedded diverse anchor graphs into a consensus anchor graph (CAG), and hence ignore redundant information and numerous noises contained in these anchor graphs, leading to a decrease in clustering effectiveness; 2) They drop effectiveness and efficiency due to independent post-processing to acquire clustering indicators. To overcome the aforementioned issues, we deliver a novel one-step multi-view clustering method with adaptive low-rank anchor-graph learning (OMCAL). To construct a high-quality CAG, OMCAL provides a nuclear norm-based adaptive CAG learning model against information redundancy and noise interference. Then, to boost clustering effectiveness and efficiency substantially, we incorporate category indicator acquisition and CAG learning into a unified framework. Numerous studies conducted on ordinary and large-scale datasets indicate that OMCAL outperforms existing state-of-the-art methods in terms of clustering effectiveness and efficiency.Keywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Anchor-based multi-view subspace clustering with hierarchical feature descentInformation Fusion, 2024
- Discrete correntropy-based multi-view anchor-graph clusteringInformation Fusion, 2023
- Multi-view clustering via efficient representation learning with anchorsPattern Recognition, 2023
- Tensorized Anchor Graph Learning for Large-scale Multi-view ClusteringCognitive Computation, 2023
- Sample-level weights learning for multi-view clustering on spectral rotationInformation Sciences, 2022
- Scalable multi-view clustering with graph filteringNeural Computing and Applications, 2022
- Efficient and Robust MultiView Clustering With Anchor Graph RegularizationIEEE Transactions on Circuits and Systems for Video Technology, 2022
- Harnessing Structures in Big Data via Guaranteed Low-Rank Matrix Estimation: Recent Theory and Fast Algorithms via Convex and Nonconvex OptimizationIEEE Signal Processing Magazine, 2018
- An Overview of Cross-Media Retrieval: Concepts, Methodologies, Benchmarks, and ChallengesIEEE Transactions on Circuits and Systems for Video Technology, 2017
- Learning the parts of objects by non-negative matrix factorizationNature, 1999