Papers › Similarity Preserving Unsupervised Feature Selection based on Sparse Learning
Similarity Preserving Unsupervised Feature Selection based on Sparse Learning
Hadi Zare, Mohsen Ghassemi Parsa, Mehdi Ghatee, Sasan H. Alizadeh
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
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections