English

One-step Multi-view Clustering With Adaptive Low-rank Anchor-graph Learning

Machine Learning 2025-09-19 v1 Computer Vision and Pattern Recognition

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

Cite

@article{arxiv.2509.14724,
  title  = {One-step Multi-view Clustering With Adaptive Low-rank Anchor-graph Learning},
  author = {Zhiyuan Xue and Ben Yang and Xuetao Zhang and Fei Wang and Zhiping Lin},
  journal= {arXiv preprint arXiv:2509.14724},
  year   = {2025}
}

Comments

13 pages, 7 figures, journal article. Accepted by IEEE Transactions on Multimedia, not yet published online

R2 v1 2026-07-01T05:43:22.185Z