Large-Scale Tensorized Multi-View Kernel Subspace Clustering
ACM Transactions on Intelligent Systems and Technology · 31.08.2025 · 16 (4) · 1-21
DOI: 10.1145/3735644 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Intelligent Systems and Technology, online erschienen am 22.07.2025. Verfasst von Guang-Yu Zhang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 52 Literaturangaben. Gefördert von: NSFC, Science and Technology Program of Guangzhou, Open Project Program of Guangxi Key Laboratory of Digital Infrastructure.
Abstract (Originalsprache)
The anchor-based multi-view subspace clustering (AMSC) has turned into a favorable tool for large-scale multi-view clustering. However, there still exist some limitations to the current AMSC approaches. First, they typically recover anchor graph structure in the original linear space, restricting their feasibility for nonlinear scenarios. Second, they usually overlook the potential benefits of jointly capturing the inter-view and intra-view information for enhancing the anchor representation learning. Third, these approaches mostly perform anchor-based subspace learning by a specific matrix norm, neglecting the latent high-order correlation across different views. To overcome these limitations, this article presents an efficient and effective approach termed Large-Scale Tensorized Multi-View Kernel Subspace Clustering (LTKMSC). Different from the existing AMSC approaches, our LTKMSC approach exploits both inter-view and intra-view awareness for anchor-based representation building. Concretely, the low-rank tensor learning is leveraged to capture the high-order correlation (i.e., the inter-view complementary information) among distinct views, upon which the \(l_{1,2}\) norm is imposed to explore the intra-view anchor graph structure in each view. Moreover, the kernel learning technique is leveraged to explore the nonlinear anchor–sample relationships embedded in multiple views. With the unified objective function formulated, an efficient optimization algorithm that enjoys low computational complexity is further designed. Extensive experiments on a variety of multi-view datasets have confirmed the efficiency and effectiveness of our approach when compared with the other competitive approaches.
Förderung
- NSFC
- Science and Technology Program of Guangzhou
- Open Project Program of Guangxi Key Laboratory of Digital Infrastructure
- Guangdong Basic and Applied Basic Research Foundation
- Natural Science Foundation of Guangdong Province
Zitieren
APA
Zhang, G., Huang, D., & Wang, C. (2025). Large-Scale Tensorized Multi-View Kernel Subspace Clustering. ACM Transactions on Intelligent Systems and Technology, 16(4), 1-21. https://doi.org/10.1145/3735644
Vancouver
Zhang G, Huang D, Wang C. Large-Scale Tensorized Multi-View Kernel Subspace Clustering. ACM Transactions on Intelligent Systems and Technology. 2025;16(4):1-21. doi:10.1145/3735644
BibTeX
@article{Zhang2025,
author = {Zhang, Guang-Yu and Huang, Dong and Wang, Chang-Dong},
title = {Large-Scale Tensorized Multi-View Kernel Subspace Clustering},
journal = {ACM Transactions on Intelligent Systems and Technology},
year = {2025},
volume = {16},
number = {4},
pages = {1--21},
doi = {10.1145/3735644}
}
EUVIMED