An Efficient, Parallelized Algorithm for Optimal Conditional Entropy-Based Feature Selection
In Machine Learning, feature selection is an important step in classifier design. It consists of finding a subset of features that is optimum for a given cost function. One possibility to solve feature selection is to organize all possible feature subsets into a Boolean lattice and to exploit the fa...
Main Authors: | Gustavo Estrela, Marco Dimas Gubitoso, Carlos Eduardo Ferreira, Junior Barrera, Marcelo S. Reis |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-04-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/22/4/492 |
Similar Items
-
Transductive Feature Selection Using Clustering-Based Sample Entropy for Temperature Prediction in Weather Forecasting
by: Zahra Karevan, et al.
Published: (2018-04-01) -
A Bootstrap Framework for Aggregating within and between Feature Selection Methods
by: Reem Salman, et al.
Published: (2021-02-01) -
Efficient Approximation of the Conditional Relative Entropy with Applications to Discriminative Learning of Bayesian Network Classifiers
by: Paulo Mateus, et al.
Published: (2013-07-01) -
Application of Entropy Measures on Intrinsic Mode Functions for the Automated Identification of Focal Electroencephalogram Signals
by: Rajeev Sharma, et al.
Published: (2015-02-01) -
On the Smoothed Minimum Error Entropy Criterion 
by: Badong Chen, et al.
Published: (2012-11-01)