DocumentCode :
1300193
Title :
Optimum feature selection by zero-one integer programming
Author :
Ichino, Masatsugu ; Sklansky, J.
Author_Institution :
Sch. of Sci. & Eng., Tokyo Denki Univ., Saitama, Japan
Issue :
5
fYear :
1984
Firstpage :
737
Lastpage :
746
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 :
integer programming; pattern recognition; box classifiers; effectiveness; enumeration method; feature selection; minimum feature subset; optimal method; pattern classifier; zero-one integer programming; Cybernetics; Linear programming; Nickel; Support vector machine classification; Training; Tumors; Vectors;
fLanguage :
English
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9472
Type :
jour
DOI :
10.1109/TSMC.1984.6313294
Filename :
6313294
Link To Document :
بازگشت