Subspace Clustering via Learning an Adaptive Low-Rank Graph
From MaRDI portal
Publication:4617382
DOI10.1109/TIP.2018.2825647zbMath1409.94717DBLPjournals/tip/YinXWZG18OpenAlexW2802754347WikidataQ52561365 ScholiaQ52561365MaRDI QIDQ4617382
Zongze Wu, Junbin Gao, Yun Zhang, Ming Yin, Sheng-Li Xie
Publication date: 6 February 2019
Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tip.2018.2825647
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (4)
Nonnegative self-representation with a fixed rank constraint for subspace clustering ⋮ Block diagonal representation learning for robust subspace clustering ⋮ Simultaneous multi-graph learning and clustering for multiview data ⋮ Robust \(\ell_2\)-hypergraph and its applications
This page was built for publication: Subspace Clustering via Learning an Adaptive Low-Rank Graph