Subspace Clustering via Learning an Adaptive Low-Rank Graph

DOI10.1109/TIP.2018.2825647MaRDI QIDQ4617382zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ming Yin, Zongze Wu, Yun Zhang, Junbin Gao, Shengli 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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited in

(6)

• Robust \(\ell_2\)-hypergraph and its applications
• Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
• 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
• Binary spectral clustering for multi-view data

This page was built for publication: Subspace Clustering via Learning an Adaptive Low-Rank Graph

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