Use of Contextaul Information for Feature Ranking and Discretization.

@article{DBLP:journals/tkde/Hong97a,
  author    = {Se June Hong},
  title     = {Use of Contextaul Information for Feature Ranking and Discretization},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {9},
  number    = {5},
  year      = {1997},
  pages     = {718-730},
  ee        = {db/journals/tkde/Hong97a.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]

Peter Clark, Tim Niblett: The CN2 Induction Algorithm. Machine Learning 3: 261-283(1989) BibTeX

[2]

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

[3]

...

[4]

Chidanand Apté, Fred Damerau, Sholom M. Weiss: Automated Learning of Decision Rules for Text Categorization. ACM Trans. Inf. Syst. 12(3): 233-251(1994) BibTeX

[5]

...

[6]

Sreerama K. Murthy, Simon Kasif, Steven Salzberg, Richard Beigel: OC1: A Randomized Induction of Oblique Decision Trees. AAAI 1993: 322-327 BibTeX

[7]

...

[8]

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

[9]

Igor Kononenko, Edvard Simec, Marko Robnik-Sikonja: Overcoming the Myopia of Inductive Learning Algorithms with RELIEFF. Appl. Intell. 7(1): 39-55(1997) BibTeX

[10]

...

[11]

Hussein Almuallim, Thomas G. Dietterich: Learning with Many Irrelevant Features. AAAI 1991: 547-552 BibTeX

[12]

...

[13]

Ning Shan, Wojciech Ziarko, Howard J. Hamilton, Nick Cercone: Using Rough Sets as Tools for Knowledge Discovery. KDD 1995: 263-268 BibTeX

[14]

...

[15]

Leo Breiman, J. H. Friedman, R. A. Olshen, C. J. Stone: Classification and Regression Trees. Wadsworth 1984, ISBN 0-534-98053-8
BibTeX

[16]

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

[17]

Randal E. Bryant: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Computers 35(8): 677-691(1986) BibTeX

[18]

...

[19]

...

[20]

J. Ross Quinlan: Simplifying Decision Trees. International Journal of Man-Machine Studies 27(3): 221-234(1987) BibTeX

[21]

Se June Hong: R-MINI: An Iterative Approach for Generating Minimal Rules from Examples. IEEE Trans. Knowl. Data Eng. 9(5): 709-717(1997) BibTeX

[22]

Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth: Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36(4): 929-965(1989) BibTeX

[23]

...

[24]

James Dougherty, Ron Kohavi, Mehran Sahami: Supervised and Unsupervised Discretization of Continuous Features. ICML 1995: 194-202 BibTeX

[25]

...

[26]

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

[27]

...

[28]

...

[29]

...

[30]

Donald Michie, David J. Spiegelhalter, C. C. Taylor: Machine Learning, Neural and Statistical Classification. Ellis Horwood 1994, ISBN 0-13-106360-X
BibTeX

Referenced by

1. Se June Hong: R-MINI: An Iterative Approach for Generating Minimal Rules from Examples. IEEE Trans. Knowl. Data Eng. 9(5): 709-717(1997)