Efficient Discrete Multi-View Clustering with Tensorized Label Learning
- 1School of Computer and Software Engineering, Shenzhen University of Information Technology, Shenzhen 518172, China
- 2Department of Computer and Information Science, University of Macau, Macau 999078, China
- 3School of Mathematics, Harbin Engineering University, Harbin 150001, China
Abstract
Anchor graphs are widely recognized for their capability to reduce the computational complexity of clustering. When regression techniques are applied to anchor graphs, existing regression-based methods mainly focus on directly learning sample labels, while the label distribution induced on anchors through sample–anchor relationships remains insufficiently explored. We propose Efficient Discrete Multi-View Clustering with Tensorized Label Learning (EDMVC_TLL) to address this limitation. Specifically, we fully leverage the probabilistic properties of anchor graphs to establish the relationship between sample labels and anchor labels, utilizing anchor labels to guide the learning of sample labels. Furthermore, we introduce an innovative regularization term to balance anchor labels, avoiding trivial solutions and enhancing sample labels’ quality. The tensor Schatten p-norm explores complementary information embedded in different views. Additionally, we adopt an adaptive anchor graph, integrating it into the subsequent optimization process to improve the quality of the anchor graph. An efficient optimization algorithm is developed, and extensive experiments on six benchmark datasets demonstrate that EDMVC_TLL consistently achieves the best performance in terms of ACC, NMI, and Purity among the compared methods.
Related
- Probabilistic Anchor Graph Projection for Tensorized Unified Label Learning
- Multi-Task Active Learning with Efficient Resource Allocation
- Efficient Clustering with Quality Guardrails for LLM-based Recommender Systems at Industry Scale
- Efficient and Generalizable Archetypal Analysis for Discrete Data
- Approximation theory of tree tensor networks: tensorized multivariate functions
BibTeX
@article{li2026efficient,
title = {{Efficient Discrete Multi-View Clustering with Tensorized Label Learning}},
author = {Qin Li and Geng Yang and Bob Zhang and Ming Yang},
journal = {Mathematics},
year = {2026},
month = oct,
doi = {10.3390/math14203838},
url = {https://www.mdpi.com/2227-7390/14/20/3838},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Efficient Discrete Multi-View Clustering with Tensorized Label Learning
AU - Qin Li
AU - Geng Yang
AU - Bob Zhang
AU - Ming Yang
PY - 2026
DA - 2026/10/21
JO - Mathematics
DO - 10.3390/math14203838
UR - https://www.mdpi.com/2227-7390/14/20/3838
AB - Anchor graphs are widely recognized for their capability to reduce the computational complexity of clustering. When regression techniques are applied to anchor graphs, existing regression-based methods mainly focus on directly learning sample labels, while the label distribution induced on anchors through sample–anchor relationships remains insufficiently explored. We propose Efficient Discrete Multi-View Clustering with Tensorized Label Learning (EDMVC_TLL) to address this limitation. Specifically, we fully leverage the probabilistic properties of anchor graphs to establish the relationship between sample labels and anchor labels, utilizing anchor labels to guide the learning of sample labels. Furthermore, we introduce an innovative regularization term to balance anchor labels, avoiding trivial solutions and enhancing sample labels’ quality. The tensor Schatten p-norm explores complementary information embedded in different views. Additionally, we adopt an adaptive anchor graph, integrating it into the subsequent optimization process to improve the quality of the anchor graph. An efficient optimization algorithm is developed, and extensive experiments on six benchmark datasets demonstrate that EDMVC_TLL consistently achieves the best performance in terms of ACC, NMI, and Purity among the compared methods.
SN - 2227-7390
ER -