Cluster-aware Anchor Learning for Multi-View Clustering

Anchor-based multi-view clustering is attractive for its efficiency, yet most methods fix the number of anchors a priori, implicitly assuming uniform needs across clusters. In practice, clusters differ in information richness, scale, and intrinsic structure, motivating adaptive per-cluster anchor allocation. We propose Cluster-aware Anchor Learning (CAL), which learns a consensus anchor matrix and organizes its columns into cluster-specific anchor groups. CAL imposes an $\ell_{2,1}$-norm column-sparsity penalty on each group to suppress redundancy and preserve cluster-discriminative features, thereby automatically determining how many anchors each cluster retains. To further enhance separability, CAL introduces an inter-cluster regularization that constrains relationships among groups, promoting mutual dissimilarity. This data-driven design learns higher-quality, cluster-aware anchors and yields a more discriminative representation matrix across multiple views. Extensive experiments on multiple benchmarks show that CAL outperforms state-of-the-art multi-view clustering methods, demonstrating superior effectiveness, robustness, and adaptability to heterogeneous cluster structures.