Label Learning Method Based on Tensor Projection
Not on the map. Why?
Abstract (arXiv)
Multi-view clustering method based on anchor graph has been widely concerned due to its high efficiency and effectiveness. In order to avoid post-processing, most of the existing anchor graph-based methods learn bipartite graphs with connected components. However, such methods have high requirements on parameters, and in some cases it may not be possible to obtain bipartite graphs with clear connected components. To end this, we propose a label learning method based on tensor projection (LLMTP). Specifically, we project anchor graph into the label space through an orthogonal projection matrix to obtain cluster labels directly. Considering that the spatial structure information of multi-view data may be ignored to a certain extent when projected in different views separately, we extend the matrix projection transformation to tensor projection, so that the spatial structure information between views can be fully utilized. In addition, we introduce the tensor Schatten p-norm regularization to make the clustering label matrices of different views as consistent as possible. Extensive experiments have proved the effectiveness of the proposed method.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 40 references that are in the map. First posted on arXiv 26 Feb 2024.
Builds on
6 of 40 references.
References · 6
- 2019Large-scale Multi-view Subspace Clustering in Linear Timecited by 66
- 2018Essential Tensor Learning for Multi-view Spectral Clusteringcited by 31
- 2015Weighted Schatten p-Norm Minimization for Image Denoising and Background Subtractioncited by 29
- 2021Effective and Efficient Graph Learning for Multi-view Clusteringcited by 28
- 2022Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondencescited by 20
- 2017A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimizationcited by 10
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.