Model switching for bayesian classification trees with soft splits

N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Due to the high number of insolvencies in the credit business, automatic procedures for testing the credit-worthiness of enterprises become increasingly important. For this task we use classification trees with soft splits which assign the observations near the split boundary to both branches. Tree models involve an extra complication as the number of parameters varies as the tree grows and shrinks. Hence we adapt the reversible jump Markov Chain Monte Carlo procedure to this model which produces an ensemble of trees representing the posterior distribution. For a real-world credit-scoring application our algorithm yields lower classification errors than bootstrapped versions of regression trees (CART), neural networks, and adaptive splines (MARS). The predictive distribution allows to assess the certainty of credit decisions for new cases and guides the collection of additional information.

Cite

CITATION STYLE

APA

Kindermann, J., & Paass, G. (1998). Model switching for bayesian classification trees with soft splits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1510, pp. 148–157). Springer Verlag. https://doi.org/10.1007/bfb0094815

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free