Advertisement

A Decision Tree Algorithm for Ordinal Classification

  • Rob Potharst
  • Jan C. Bioch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1642)

Abstract

In many classiffication problems the domains of the attributes and the classes are linearly orderded. For such problems the classiffication rule often needs to be order-preserving or monotone as we call it. Since the known decision tree methods generate non-monotone trees, these methods are not suitable for monotone classiffication problems. We provide an order-preserving tree-generation algorithm for multi-attribute classiffication problems with k linearly ordered classes, and an algorithm for repairing non-monotone decision trees. The performance of these algorithms is tested on random monotone datasets.

Keywords

Decision Tree Class Label Input Space Maximal Element Average Path Length 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ben-David, A., Sterling, L., Pao, Y. H., (1989). Learning and Classification of monotonic ordinal concepts. In: Computational Intelligence, vol. 5, pp. 45–49.CrossRefGoogle Scholar
  2. 2.
    Ben-David, A., (1992). Automatic generation of symbolic multiattribute ordinal knowledge-based DSSs: methodology and applications. In: Decision Sciences, vol. 23, pp. 1357–1372.CrossRefGoogle Scholar
  3. 3.
    Ben-David, A., (1995). Monotonicity maintenance in information-theoretic machine learning algorithms. In: Machine Learning, vol. 19, pp. 29–43.Google Scholar
  4. 4.
    Breiman, L., Friedman, J. H., Olshen, R. A., Stone, C. J., (1984). Classification and regression trees. Chapman and Hall, NewYork. Second Edition 1993.zbMATHGoogle Scholar
  5. 5.
    Makino, K., Suda, T., Yano, K., Ibaraki, T., (1996). Data analysis by positive decision trees. In: International symposium on cooperative database systems for advanced applications (CODAS), Kyoto, pp. 282–289.Google Scholar
  6. 6.
    Potharst, R., Bioch, J. C., Petter, T. C., (1997). Monotone decision trees. Technical Report EUR-FEW-CS-97-06, Erasmus University Rotterdam.Google Scholar
  7. 7.
    Potharst, R., Bioch, J. C., van Dordregt, R., (1998). Quasi-monotone decision trees for ordinal Classification. Technical Report EUR-FEW-CS-98-01, Erasmus University Rotterdam.Google Scholar
  8. 8.
    Potharst, R., (1999). Classification using Decision Trees and Neural Nets. PhD-dissertation, Erasmus University Rotterdam, 1999.Google Scholar
  9. 9.
    J. R. Quinlan, (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann, San Mateo, California.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Rob Potharst
    • 1
  • Jan C. Bioch
    • 1
  1. 1.Erasmus University RotterdamDR RotterdamThe Netherlands

Personalised recommendations