The feature selection process is indispensable for the machine learning area to avoid the curse of dimensionality. Hereof, the feature selection techniques endeavor to handle this issue. Yet, the feature selection techniques hold several weaknesses: (i) the efficacy of the machine learning methods could be quite different on the chosen features (ii) by depending on the selected subset, substantial differences in the effectiveness of the machine learning algorithms could also be monitored (iii) the feature selection algorithms can consume much time on massive data. In this work, to address the issues above, we suggest a new and quick unsupervised feature selection procedure, which is based on a filter and univariate technique. The offered approach together regards both the Shannon entropy computed by the symmetry of the distribution and the cumulative entropy of the distribution. As a consequence of comparisons done with some cutting-edge feature selection strategies, the empirical results indicate that the presented algorithm solves these problems in a better way than other methods.
Machine Learning Unsupervised Feature Selection Univariate-filter Approach Cumulative Entropy Shannon Entropy
Primary Language | English |
---|---|
Subjects | Computer Vision and Multimedia Computation (Other) |
Journal Section | Research Articles |
Authors | |
Early Pub Date | June 3, 2024 |
Publication Date | June 15, 2024 |
Submission Date | April 3, 2024 |
Acceptance Date | May 27, 2024 |
Published in Issue | Year 2024 Volume: 5 Issue: 1 |
This work is licensed under a Creative Commons Attribution 4.0 International License.