Unsupervised feature selection by non-convex regularized self-representation
Expert Systems with Applications(2021)
Abstract
•An ℓ2,1-2 self-representation unsupervised feature selection is proposed.•ℓ2,1-2 is proved to guarantee the sparsity of selection matrix in theory.•An iterative CCCP algorithm is designed to tackle the nonconvexity of ℓ2,1-2.•The global convergence of our CCCP is theoretically analyzed.•Extensive experimental results verify the effectiveness of the proposed method.
MoreTranslated text
Key words
Unsupervised feature selection,Self-representation,Non-convex regularization,CCCP,ADMM
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined