Proceedings

Decision Trees in Numerical Attribute Spaces

Download BibTeX Cite

Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Machine Learning. Pages 1016-1020.

© 1993 International Joint Conferences on Artificial Intelligence

Abstract

Research in Supervised Concept learning has not paid special attention to Numerical Attribute Spaces, although they present particular characteristics. One of them is that the combinatorial complexity of finding the correct disjunctions of the target concepts is much higher than with Nominal Attributes. In this paper, we argue that new kinds of heuristics using numerical similarities among training instances should be used. In the framework of TDIDT, we present a new approach that uses unsupervised heuristics issued from Cluster Analysis for selecting generalisation steps. Empirical tests show promising results, at least when the target concept is only partially represented in the training.

  1. [Aha and al., 1991] Aha W. David, Kibler D. and Albert K. M. Instance-Based Learning Algorithms. Machine Learning vol.6, n° 1, January 1991.
  2. Breiman and al., 1984)
  3. Breiman L., Friedman J.H., Olshen R.A. and Stone C.J. Classification And Regression Trees. Wadsworth & Brooks, 1984. [Cestnik and al., 1987) Cestnik Bojan, Kononenko Igor and Bratko Ivan. Assistant 86: A Knowledge-Elicitation Tool for Sophisticated Users. Proceedings of the Second European Workshop on Machine Learning,1987.
  4. [Clark and Niblett, 1987] Clark P. and Niblett T. Induction in Noisy Domains. Proceedings of the Second European Workshop on Machine Learning, 19!!7.
  5. [Gams and Lavrac, 1987] Gams M., and Lavrac N. Review of Five Empirical Learning Systems Within a Proposed Schemata. Proceedings of the Second European Workshop on Machine Learning, 1987.
  6. Kaufman and Rouseeuw, 1990) Kaufman Leonard and Rouseeuw Peter. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley-lnterscience Publication, 1990.
  7. Matheus and al., 1989)
  8. Matheus Christopher J. and Rendell Larry A. Constructive Induction on Decision Tees . Proceedings of IJCAI, 1989.
  9. Mingers, 1989)
  10. Mingers J. An Empirical Comparison of Selection Measures for Decision-Tree Induction. Machine Learning Vol. 3 n°4, March 1989.
  11. Quinlan, 1896)
  12. Quinlan J. Ross. Induction of Decision Trees. Machine Learning Vol! n°l, 1986.
  13. Quinlan, 1989)
  14. Quinlan J. Ross. Unknown Attribute values in Induction. Proceedings of the Sixth International Workshop on Machine Learning, Morgan Kaufmann, 1989.
  15. [Rendell and al., 1989] Rendell L., Cho H. and Seshu R. Improving the Design of Similarity-Based Rule-Learning Systems. International Journal of Expert Systems Vo1.2 n° 1, 1989.
  16. Rendell, 1988)
  17. Rendell L. Learning Hard Concepts. Proceedings of the Third European Workshop on Machine Learning, 1988.
  18. [Rendell and Cho, 1990] Rendell L. and Cho H. Empirical Learning as a Function of Concept Character. Machine Learning Vol. 5 no 3, August 1990.
  19. Van de Merckt, 1992) Van de Merckt T. NFDT: A System that Learns Flexible Concepts based on Decision Trees for Numerical Attributes. Proceedings of the Ninth International Conference on Machine Learning, Morgan Kaufmann, 1992.
  20. Yang and al., 1991) Yang Dcr-Shung, Blix Gunnar and Rendell Larry J. The Replication Problem: A constructive Induction Approach. Proceedings of the Sixth European Workshop on Machine Learning, 1991.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards