Landmark-based k-factorization multi-view subspace clustering

DOI10.1016/J.INS.2024.120480MaRDI QIDQ6544572zbMATH OpenFDO

Authors Yuan Fang, Geping Yang, Xiang Chen, Zhiguo Gong, Yiyang Yang, Can Chen, Zhifeng Hao

Publication date 27 May 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2024.120480

zbMATH Keywords

\(k\)-factorizationgraph alignmentlandmarkslarge scalemulti-view clusteringsubspace clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites work

• A fast projected fixed-point algorithm for large graph matching
• First-order methods in optimization
• Multimodal Deep Autoencoder for Human Pose Recovery
• Nonconvex multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix*
• Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy

This page was built for publication: Landmark-based \(k\)-factorization multi-view subspace clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544572)