Dynamic discretization of continuous attributes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1484, Issue , 1998, Pages 160-169

  Gama, João ^a   Torgo, Luis ^a   Soares, Carlos ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Continuous attributes; Discretization; Feature selection

Indexed keywords

BAYESIAN NETWORKS; DECISION TREES; FEATURE EXTRACTION; MACHINE LEARNING;

ATTRIBUTE SELECTION; BAYESIAN APPROACHES; BENCHMARK DATASETS; CONTINUOUS ATTRIBUTE; DISCRETIZATIONS; DYNAMIC DISCRETIZATION; EMPIRICAL EVALUATIONS; GENERALIZATION ACCURACY;

LEARNING ALGORITHMS;

EID: 79955570588     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49795-1_14     Document Type: Conference Paper

References (12)

1. J. Catlett. Megainduction: a test flight. In Machine Learning: Proceedings of the 8 International Conference. Morgan Kaufmann, 1991. 160
2. J. Catlett. On changing continuous attributes into ordered discrete attributes. I Y. Kodratoff, editor, European Working Session on Learning -EWSL91. LNAI 482 Springer Verlag, 1991. 162
3. P. Domingos and M. Pazzani. Beyond independence: Conditions for the optimality of the simple bayesian classifier. In L. Saitta, editor, Machine Learning Proc. of 13th International Conference. Morgan Kaufmann, 1996. 160, 161
4. J. Dougherty, R. Kohavi, and M. Sahami. Supervised and unsupervised discretization of continuous features. In A. Prieditis and S. Russel, editors, Machine Learning Proc. of 12th International Conference. Morgan Kaufmann, 1995. 161, 163
5. U. Fayyad and K Irani. Multi-interval discretization of continuous-valued attributes for classification learning. In 13th International Joint Conference of Artificial Intelligence, 1993. 161, 162, 163
6. R.C. Holte. Very simple classification rules perform well on most commonly used datasets. Machine Learning, Vol, 11, 1993. 162
7. R. Kohavi and M. Sahami. Error-based and entropy-based discretization of continuous features. In Proceedings of KDD 96, 1996. 160
8. B. Moret and H. Shapiro. Algorithms from P to NP - Design and Efficiency, Vol. 1. The Benjamin Publishers, 1990. 165
9. Kerber R. Chimerge: discretization of numeric attributes. In Proceedings of the 10 National Conference on Artificial Intelligence. MIT Press, 1992. 162
10. M. Richeldi and M. Rossoto. Class driven statistical discretization of continuous attributes. In S. Wrobel and N. Lavrac, editors, Machine Learning: ECML-95. LNAI 912, Springer Verlag, 1995. 162
11. M. Robnik-Sikonja and I Kononenko. Discretization of continuous attributes using relieff. In Proceedings of RK95, 1995. 163
12. L. Torgo and J. Gama. Search-based class discretization. In Proceedings ECML-97. LNAI 1224, Springer Verlag, 1997. 161