We consider the problem of feature selection, and we propose a new information-theoretic algorithm for ordering the features according to their relevance for classification. The novelty of our proposal consists in adopting Rényi min-entropy instead of the commonly used Shannon entropy. In particular, we adopt a notion of conditional min-entropy that has been recently proposed in the field of security and privacy, and which is strictly related to the Bayes error. We evaluate our method on two classifiers and three datasets, and we show that it compares favorably with the corresponding one based on Shannon entropy.
CITATION STYLE
Palamidessi, C., & Romanelli, M. (2018). Feature selection with rényi min-entropy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11081 LNAI, pp. 226–239). Springer Verlag. https://doi.org/10.1007/978-3-319-99978-4_18
Mendeley helps you to discover research relevant for your work.