Sparse subspace clustering with jointly learning representation and affinity matrix

DOI10.1016/j.jfranklin.2018.02.024OpenAlexW2789696179WikidataQ130108096 ScholiaQ130108096MaRDI QIDQ1643239

Panshuo Li, Ming Yin, Deyu Zeng, Zongze Wu, Sheng-Li Xie

Publication date: 19 June 2018

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2018.02.024

zbMATH Keywords

representation matrixaffinity matrixsparse subspace clustering (SSC)

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Three-constraints affinity matrix on simultaneous identification of the clustering and cardinality of wireless propagation multipaths ⋮ Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization

Cites Work

• Unnamed Item
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• A Singular Value Thresholding Algorithm for Matrix Completion
• Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering
• Enhanced Local Texture Feature Sets for Face Recognition Under Difficult Lighting Conditions
• Compressed sensing

This page was built for publication: Sparse subspace clustering with jointly learning representation and affinity matrix