Nothing Special   »   [go: up one dir, main page]

Skip to main content

A Decision Tree Algorithm for Ordinal Classification

  • Conference paper
  • First Online:
Advances in Intelligent Data Analysis (IDA 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1642))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  3. Ben-David, A., (1995). Monotonicity maintenance in information-theoretic machine learning algorithms. In: Machine Learning, vol. 19, pp. 29–43.

    Google Scholar 

  4. Breiman, L., Friedman, J. H., Olshen, R. A., Stone, C. J., (1984). Classification and regression trees. Chapman and Hall, NewYork. Second Edition 1993.

    MATH  Google Scholar 

  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. 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. 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. Potharst, R., (1999). Classification using Decision Trees and Neural Nets. PhD-dissertation, Erasmus University Rotterdam, 1999.

    Google Scholar 

  9. J. R. Quinlan, (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann, San Mateo, California.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Potharst, R., Bioch, J.C. (1999). A Decision Tree Algorithm for Ordinal Classification. In: Hand, D.J., Kok, J.N., Berthold, M.R. (eds) Advances in Intelligent Data Analysis. IDA 1999. Lecture Notes in Computer Science, vol 1642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48412-4_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-48412-4_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66332-4

  • Online ISBN: 978-3-540-48412-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics