Skip to main content

Isotonic Classification Trees

  • Conference paper
Advances in Intelligent Data Analysis VIII (IDA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5772))

Included in the following conference series:

Abstract

We propose a new algorithm for learning isotonic classification trees. It relabels non-monotone leaf nodes by performing the isotonic regression on the collection of leaf nodes. In case two leaf nodes with a common parent have the same class after relabeling, the tree is pruned in the parent node. Since we consider problems with ordered class labels, all results are evaluated on the basis of L 1 prediction error. We experimentally compare the performance of the new algorithm with standard classification trees.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. Anglin, P.M., Gençay, R.: Semiparametric estimation of a hedonic price function. Journal of Applied Econometrics 11(6), 633–648 (1996)

    Article  Google Scholar 

  2. Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)

    Google Scholar 

  3. Barile, N., Feelders, A.: Nonparametric monotone classification with MOCA. In: Giannotti, F. (ed.) Proceedings of the Eighth IEEE International Conference on Data Mining (ICDM 2008), pp. 731–736. IEEE Computer Society, Los Alamitos (2008)

    Chapter  Google Scholar 

  4. Ben-David, A., Sterling, L., Pao, Y.: Learning and classification of monotonic ordinal concepts. Computational Intelligence 5, 45–49 (1989)

    Article  Google Scholar 

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

    Google Scholar 

  6. Bloch, D.A., Silverman, B.W.: Monotone discriminant functions and their applications in rheumatology. Journal of the American Statistical Association 92(437), 144–153 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification And Regression Trees. Chapman and Hall, Boca Raton (1984)

    MATH  Google Scholar 

  8. Brunk, H.D.: Conditional expectation given a σ-lattice and applications. Annals of Mathematical Statistics 36, 1339–1350 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  9. Daniels, H.A.M., Kamp, B.: Application of MLP networks to bond rating and house pricing. Neural Computing & Applications 8(3), 226–234 (1999)

    Article  Google Scholar 

  10. Dykstra, R., Hewett, J., Robertson, T.: Nonparametric, isotonic discriminant procedures. Biometrika 86(2), 429–438 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Feelders, A., Pardoel, M.: Pruning for monotone classification trees. In: Berthold, M.R., Lenz, H.-J., Bradley, E., Kruse, R., Borgelt, C. (eds.) IDA 2003. LNCS, vol. 2810, pp. 1–12. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Karpf, J.: Inductive modelling in law: example based expert systems in administrative law. In: Proceedings of the third international conference on artificial intelligence in law, pp. 297–306. ACM Press, New York (1991)

    Google Scholar 

  13. Kotlowski, W., Slowinski, R.: Statistical approach to ordinal classification with monotonicity constraints. In: ECML PKDD 2008 Workshop on Preference Learning (2008)

    Google Scholar 

  14. Lievens, S., De Baets, B., Cao-Van, K.: A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting. Annals of Operations Research 163, 115–142 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Long, J.: NASA metrics data program (2008), http://mdp.ivv.nasa.gov/repository.html

  16. Maxwell, W.L., Muckstadt, J.A.: Establishing consistent and realistic reorder intervals in production-distribution systems. Operations Research 33(6), 1316–1341 (1985)

    Article  MATH  Google Scholar 

  17. Pazzani, M.J., Mani, S., Shankle, W.R.: Acceptance of rules generated by machine learning among medical experts. Methods of Information in Medicine 40, 380–385 (2001)

    Google Scholar 

  18. Potharst, R., Bioch, J.C.: Decision trees for ordinal classification. Intelligent Data Analysis 4(2), 97–112 (2000)

    MATH  Google Scholar 

  19. Potharst, R.: Classification using Decision Trees and Neural Nets. PhD thesis, Erasmus University Rotterdam (1999)

    Google Scholar 

  20. Royston, P.: A useful monotonic non-linear model with applications in medicine and epidemiology. Statistics in Medicine 19(15), 2053–2066 (2000)

    Article  Google Scholar 

  21. Velikova, M.: Monotone Models for Prediction in Data Mining. PhD thesis, Tilburg University (2006)

    Google Scholar 

  22. Velikova, M., Daniels, H.: Decision trees for monotone price models. Computational Management Science 1(3-4), 231–244 (2004)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van de Kamp, R., Feelders, A., Barile, N. (2009). Isotonic Classification Trees. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, JF. (eds) Advances in Intelligent Data Analysis VIII. IDA 2009. Lecture Notes in Computer Science, vol 5772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03915-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03915-7_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03914-0

  • Online ISBN: 978-3-642-03915-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics