Similarity Preserving Unsupervised Feature Selection based on Sparse Learning
Various feature selection methods have been recently proposed on different applications to reduce the computational burden of machine learning algorithms as well as the complexity of learned models. Preserving sample similarities and selecting discriminative features are two major factors should be satisfied, especially by unsupervised feature selection methods. This paper aims to propose a novel unsupervised feature selection approach which employs an ℓ 2,1 -norm regularization model to preserve global and local similarities by minimizing an objective function. Cluster analysis is also incorporated in this framework to take the inherent structure of the data into account. The experimental results show the strength of the proposed approach as compared with the earlier well-known methods on a variety of standard datasets.
Code (1)
Tasks
feature selectionSparse LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Sparse PCA via $l_{2,p}$-Norm Regularization for Unsupervised Feature Selection
In the field of data mining, how to deal with high-dimensional data is an inevitable problem. Unsupervised feature selection has attracted more and more attention because it does not rely on labels. The performance of sp…
feature selectionGlobal and Local Structure Preserving Sparse Subspace Learning: An Iterative Approach to Unsupervised Feature Selection
As we aim at alleviating the curse of high-dimensionality, subspace learning is becoming more popular. Existing approaches use either information about global or local structure of the data, and few studies simultaneousl…
feature selectionC$^{2}$IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection
Multi-view unsupervised feature selection (MUFS) has been demonstrated as an effective technique to reduce the dimensionality of multi-view unlabeled data. The existing methods assume that all of views are complete. Howe…
feature selectionFast Sparse PCA via Positive Semidefinite Projection for Unsupervised Feature Selection
In the field of unsupervised feature selection, sparse principal component analysis (SPCA) methods have attracted more and more attention recently. Compared to spectral-based methods, SPCA methods don't rely on the const…
feature selectionLearning Subspace-Preserving Sparse Attention Graphs from Heterogeneous Multiview Data
The high-dimensional features extracted from large-scale unlabeled data via various pretrained models with diverse architectures are referred to as heterogeneous multiview data. Most existing unsupervised transfer learni…
Representation LearningTransfer LearningGraph Learning