Abstract
Given the high-dimensionality of the original data, dimensionality reduction becomes a necessary step in data processing. In this study, a novel unsupervised feature selection model is proposed, which regards the unsupervised feature selection process as nonnegative subspace learning. Considering the efficiency of the learned subspace which can better indicate the selected features, a nonnegative sparsity adaptive subspace learning framework is proposed. It adapts the sparsity by weighted l(2),(1) model. Specifically, the weights are defined by multi-stage support detection. Then we provide an approach to solve this weighted l(2,1) constraint non-convex problem leading to the Non-negative Sparsity Adaptive Subspace Learning (NSASL) algorithm. By the experiments which are conducted on real-word datasets, the superiority of proposed method over seven state-of-the- art unsupervised feature selection algorithms is verified.