Feature Selection via Discretization.

@article{DBLP:journals/tkde/LiuS97,
  author    = {Huan Liu and
               Rudy Setiono},
  title     = {Feature Selection via Discretization},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {9},
  number    = {4},
  year      = {1997},
  pages     = {642-645},
  ee        = {db/journals/tkde/LiuS97.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1997 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

References

[1]

Hussein Almuallim, Thomas G. Dietterich: Learning Boolean Concepts in the Presence of Many Irrelevant Features. Artif. Intell. 69(1-2): 279-305(1994) BibTeX

[2]

Jason Catlett: On Changing Continuous Attributes into Ordered Discrete Attributes. EWSL 1991: 164-178 BibTeX

[3]

Usama M. Fayyad, Keki B. Irani: The Attribute Selection Problem in Decision Tree Generation. AAAI 1992: 104-110 BibTeX

[4]

Randy Kerber: ChiMerge: Discretization of Numeric Attributes. AAAI 1992: 123-128 BibTeX

[5]

Kenji Kira, Larry A. Rendell: The Feature Selection Problem: Traditional Methods and a New Algorithm. AAAI 1992: 129-134 BibTeX

[6]

...

[7]

...

[8]

J. Ross Quinlan: C4.5: Programs for Machine Learning. Morgan Kaufmann 1993, ISBN 1-55860-238-0
BibTeX

[9]

Harish Ragavan, Larry A. Rendell: Lookahead Feature Construction for Learning Hard Concepts. ICML 1993: 252-259 BibTeX

[10]

Huan Liu, Rudy Setiono: A Probabilistic Approach to Feature Selection - A Filter Solution. ICML 1996: 319-327 BibTeX

[11]

...

[12]

...