Nonconvex tensor multiview subspace clustering with bipartite graph regularization
Authors:
- Min LiMLMin Li
- Xue YaoXYXue Yao
- Mingqing XiaoMXMingqing Xiao
- Weiwei WangWWWeiwei Wang
- 15 June 2025
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 169
Abstract
No abstract availableFunding Information
- Shenzhen Municipal Fundamental Research Program (JCYJ20200109105832261, JCYJ20210324094009026)
- Department of Education of Guangdong Province (2024ZDZX1013, 2023KTSCX116, 2023KTSCX116,2024ZDZX1013)
- National Natural Science Foundation of China (62372302, 62072312)
This publication has 28 references indexed in Scilit:
- Learning latent disentangled embeddings and graphs for multi-view clusteringPattern Recognition, 2024
- Nonconvex submodule clustering via joint sliced sparse gradient and cluster-aware approachPattern Recognition, 2024
- Non-convex tensorial multi-view clustering by integrating -based sliced-Laplacian regularization and -sparsityPattern Recognition, 2024
- Structured graph learning for clustering and semi-supervised classificationPattern Recognition, 2021
- Hyper-Laplacian regularized multi-view subspace clustering with low-rank tensor constraintNeural Networks, 2020
- Graph-regularized least squares regression for multi-view subspace clusteringKnowledge-Based Systems, 2020
- On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank MinimizationInternational Journal of Computer Vision, 2018
- Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimization2016
- Diversity-induced Multi-view Subspace Clustering2015
- Recognizing indoor scenes2009