A folded concave penalty regularized subspace clustering method to integrate affinity and clustering

DOI10.1155/2021/6641180zbMATH Open1512.62066MaRDI QIDQ6484404FDOQ6484404

Authors: Wenjuan Zhang, Xiangchu Feng, Feng Xiao, Yunmei Chen 

Publication date: 24 January 2022

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Recommendations

• A subspace clustering method based on class-wise sparse and low-rank representation
• Nonnegative self-representation with a fixed rank constraint for subspace clustering
• Subspace clustering by \((k,k)\)-sparse matrix factorization
• Block diagonal representation learning for robust subspace clustering
• A subspace clustering algorithm based on simultaneously sparse and low-rank representation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05)

This page was built for publication: A folded concave penalty regularized subspace clustering method to integrate affinity and clustering

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