A Cross-Entropy-based Method to Perform Information-based Feature Selection
Pietro Cassara, Alessandro Rozza, Mirco Nanni

TL;DR
This paper introduces a novel cross-entropy-based feature selection method that automatically determines the optimal number of features, improving classification performance and reducing computational complexity.
Contribution
The paper presents a new algorithm for feature selection based on cross-entropy that enhances mutual information methods and automatically estimates the number of features to retain.
Findings
Effective feature selection on real datasets
Automatic estimation of feature subset size
Improved classification performance
Abstract
From a machine learning point of view, identifying a subset of relevant features from a real data set can be useful to improve the results achieved by classification methods and to reduce their time and space complexity. To achieve this goal, feature selection methods are usually employed. These approaches assume that the data contains redundant or irrelevant attributes that can be eliminated. In this work, we propose a novel algorithm to manage the optimization problem that is at the foundation of the Mutual Information feature selection methods. Furthermore, our novel approach is able to estimate automatically the number of dimensions to retain. The quality of our method is confirmed by the promising results achieved on standard real data sets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
