Seeking commonness and inconsistencies: A jointly smoothed approach to multi-view subspace clustering
Authors:
- Xiaosha CaiXCXiaosha Cai
- Dong HuangDHDong Huang
- Guang-Yu ZhangGZGuang-Yu Zhang
- Chang-Dong WangCWChang-Dong Wang
- 26 October 2022
- journal article
- research article
- Published by Elsevier in Information Fusion
- Vol. 91, 364-375
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natural Science Foundation of Guangdong Province (2021A1515012203)
- National Natural Science Foundation of China (62276277)
- National Natural Science Foundation of China (61976097)
- National Natural Science Foundation of China (62206096)
- Guangzhou Municipal Science and Technology Program key projects (202201010314)
This publication has 33 references indexed in Scilit:
- Generalized Latent Multi-View Subspace ClusteringIEEE Transactions on Pattern Analysis and Machine Intelligence, 2018
- Multiview Consensus Graph ClusteringIEEE Transactions on Image Processing, 2018
- Graph Structure Fusion for Multiview ClusteringIEEE Transactions on Knowledge and Data Engineering, 2018
- Binary Multi-View ClusteringIEEE Transactions on Pattern Analysis and Machine Intelligence, 2018
- Graph Learning for Multiview ClusteringIEEE Transactions on Cybernetics, 2017
- Multi-view clustering via pairwise sparse subspace representationNeurocomputing, 2015
- Sparse Subspace Clustering: Algorithm, Theory, and ApplicationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Character Identification in Feature-Length Films Using Global Face-Name MatchingIEEE Transactions on Multimedia, 2009
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972