Optimum feature selection by zero-one integer programming
IEEE Transactions on Systems Man and CyberneticsPublished 1 September 1984
Manabu Ichino, Jack Sklansky
Citations36
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An optimal method for finding a minimum feature subset based on box classifiers is described, and numerical examples are presented to illustrate the effectiveness of the approach.
Abstract
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.
Keywords
Computer ScienceEngineering