We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Chen Bin, Hong Jiarong, Wang Yadong. The Minimum Feature Subset Selection Problem[J]. Journal of Computer Science and Technology, 1997, 12(2): 145-153.
Citation: Chen Bin, Hong Jiarong, Wang Yadong. The Minimum Feature Subset Selection Problem[J]. Journal of Computer Science and Technology, 1997, 12(2): 145-153.

The Minimum Feature Subset Selection Problem

More Information
  • Published Date: March 09, 1997
  • In applications of learning from examples to real-world tasks, feature subset selection is important to speed up training and to improve generalization performance. ideally, an inductive algorithm should use subset of features as small as possible. In this paper however, the authors show that the problem of selecting the minimum subset of features is NP-hard. The paper then presents a greedy algorithm for feature subset selection. The result of running the greedy algorithm on hand-written numeral recognitio…
  • [1]
    Almuallim H, Dietterich T G. Learning with many irrelevant features. In AAAI-91 Proc., 9th National Conference on Artificial Intelligence, 1991.
    [2]
    Kira K, Rendell L. The feature selection problem: Traditional methods and a new algorithm. In AAAI-92 Proc., 10th International Conference on Artificial Intelligence, 1992.
    [3]
    Caruana R, Freitag D. Greedy Attribute Selection. ML'94, Rutgers University, New Brunswick, NJ, pp.28-36, 1994. ……….

Catalog

    Article views (40) PDF downloads (1334) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return