Optimum feature selection by zero-one integer programming
Manabu Ichino, Jack Sklansky · IEEE Transactions on Systems Man and Cybernetics · 1984
An optimal method for finding a minimum feature subset based on box classifiers is described. Feature selection is represented as a problem of zero-one integer programming. An implicit enumeration method is developed in order to solve this problem. Numerical examples are presented to illustrate the effectiveness of the approach.
Cited by 38 works. doi:10.1109/tsmc.1984.6313294