Adaptively Topological Tensor Network for Multi-view Subspace Clustering
Not on the map. Why?
Abstract (arXiv)
Multi-view subspace clustering methods have employed learned self-representation tensors from different tensor decompositions to exploit low rank information. However, the data structures embedded with self-representation tensors may vary in different multi-view datasets. Therefore, a pre-defined tensor decomposition may not fully exploit low rank information for a certain dataset, resulting in sub-optimal multi-view clustering performance. To alleviate the aforementioned limitations, we propose the adaptively topological tensor network (ATTN) by determining the edge ranks from the structural information of the self-representation tensor, and it can give a better tensor representation with the data-driven strategy. Specifically, in multi-view tensor clustering, we analyze the higher-order correlations among different modes of a self-representation tensor, and prune the links of the weakly correlated ones from a fully connected tensor network. Therefore, the newly obtained tensor networks can efficiently explore the essential clustering information with self-representation with different tensor structures for various datasets. A greedy adaptive rank-increasing strategy is further applied to improve the capture capacity of low rank structure. We apply ATTN on multi-view subspace clustering and utilize the alternating direction method of multipliers to solve it. Experimental results show that multi-view subspace clustering based on ATTN outperforms the counterparts on six multi-view datasets.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 14 of its 79 references that are in the map. First posted on arXiv 1 May 2023.
Builds on
14 of 79 references.
References · 14
- 2016Tensor Ring Decompositioncited by 125
- 2016Efficient tensor completion for color image and video recovery: Low-rank tensor traincited by 61
- 2019Ultra-Scalable Spectral Clustering and Ensemble Clusteringcited by 50
- 2017Efficient Low Rank Tensor Ring Completioncited by 45
- 2018Essential Tensor Learning for Multi-view Spectral Clusteringcited by 31
- 2017Multi-view Low-rank Sparse Subspace Clusteringcited by 27
- 2016On Unifying Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimizationcited by 25
- 2020Multi-View Spectral Clustering Tailored Tensor Low-Rank Representationcited by 21
- 2022Seeking Commonness and Inconsistencies: A Jointly Smoothed Approach to Multi-view Subspace Clusteringcited by 13
- 2015Matching-CNN Meets KNN: Quasi-Parametric Human Parsingcited by 9
- 2019Low-rank Kernel Learning for Graph-based Clusteringcited by 7
- 2016Learning From Hidden Traits: Joint Factor Analysis and Latent Clusteringcited by 5
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 1.
4 papers.
- 2023SVDinsTN: A Tensor Network Paradigm for Efficient Structure Search from Regularized Modeling Perspectivecited by 9
- 2024Web Service QoS Prediction via Extended Canonical Polyadic-based Tensor Networkcited by 0
- 2025Fast and Accurate Power Load Data Completion via Regularization-optimized Low-Rank Factorizationcited by 0
- 2026Tensor Decomposition Structure Search Framework from an Interaction Perspectivecited by 0
- 2026Tensor Decomposition Structure Search Framework from an Interaction Perspective3 Mar 2026
- 2025Fast and Accurate Power Load Data Completion via Regularization-optimized Low-Rank Factorization25 May 2025
- 2024Web Service QoS Prediction via Extended Canonical Polyadic-based Tensor Network29 Aug 2024
- 2023SVDinsTN: A Tensor Network Paradigm for Efficient Structure Search from Regularized Modeling Perspective24 May 2023