Skip to main content

Bayesian classification trees with overlapping leaves applied to credit-scoring

  • Papers
  • Conference paper
  • First Online:
Research and Development in Knowledge Discovery and Data Mining (PAKDD 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1394))

Included in the following conference series:

Abstract

We develop a Bayesian procedure for classification with trees by switching between different model structures. For classification trees with overlap we use a Markov chain Monte Carlo procedure to produce an ensemble of trees which allow the assessment of prediction uncertainty and the value of new information. The approach is applied to a large credit scoring application.

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. J.O. Berger. Statistical Decision Theory, Foundations, Concepts and Methods. Springer, New York. 1980.

    Book  MATH  Google Scholar 

  2. L. Breiman, J.H. Friedman, R. Olshen, and C.J. Stone. Classification and Regression Trees. Wadsworth International Group, Belmont, California, 1984.

    MATH  Google Scholar 

  3. W. Buntine. Learning classification trees. Statistics and Computing. 2:63–73, 1992.

    Article  Google Scholar 

  4. H. Chipman, E. George, and R. McCulloch. Bayesian CART. Technical report, Department of Statistics, University of Texas at Austin, 1995.

    Google Scholar 

  5. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, new York, 1996.

    Book  MATH  Google Scholar 

  6. J. H. Friedman. Multivariate adaptive regression splines. Annals of Statistics. 19(1):1–67, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  7. J.H. Friedman. Local learning based on recursive covering. Technical report, Stanford Uni, August 1996.

    Google Scholar 

  8. J. Graf and G. Nakhaeizadeh. Recent development in solving the credit-scoring problem. In V.L. Plantamura, editor, Logistic and Learning for Quality Software, Managment and Manufacturing?, New York, 1993.

    Google Scholar 

  9. P. J. Green. Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Technical report, Bristol Univ., 1995.

    Google Scholar 

  10. W.K. Hastings. Monte Carlo sampling methods using Markov chains and their application. Biometrika, 57:97–109, 1970.

    Article  MathSciNet  MATH  Google Scholar 

  11. G. Paass and J. Kindermann. Bayesian query construction for neural network models. In G. Tesauro, D. Touretzky, and T. Leen, editors, Advances in Neural Information Processing Systems 7, pages 443–450. The MIT Press, 1995.

    Google Scholar 

  12. B.D. Ripley. Pattern Recognition and Neural Networks. Cambridge University Press, Cambrideg, 1996.

    Book  MATH  Google Scholar 

  13. L. Tierney. Markov chains for exploring posterior distributions. Technical Report 560, School of Statistics, Univ. of Minnesota, 1994.

    Google Scholar 

  14. J. Wallrafen. Kreditwürdigkeitsprüfung von Unternehmen mit neuronalen Klassifikationsverfahren (credit scoring of enterprises with neural classification procedures). Master's thesis, University of Erlangen-Nürnberg, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paass, G., Kindermann, J. (1998). Bayesian classification trees with overlapping leaves applied to credit-scoring. In: Wu, X., Kotagiri, R., Korb, K.B. (eds) Research and Development in Knowledge Discovery and Data Mining. PAKDD 1998. Lecture Notes in Computer Science, vol 1394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64383-4_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-64383-4_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64383-8

  • Online ISBN: 978-3-540-69768-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics