𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Meta-learning Framework for Bankruptcy Prediction

✍ Scribed by Chih-Fong Tsai; Yu-Feng Hsu


Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
404 KB
Volume
32
Category
Article
ISSN
0277-6693

No coin nor oath required. For personal study only.

✦ Synopsis


ABSTRACT

The implication of corporate bankruptcy prediction is important to financial institutions when making lending decisions. In related studies, many bankruptcy prediction models have been developed based on some machine‐learning techniques. This paper presents a meta‐learning framework, which is composed of two‐level classifiers for bankruptcy prediction. The first‐level multiple classifiers perform the data reduction task by filtering out unrepresentative training data. Then, the outputs of the first‐level classifiers are utilized to create the second‐level single (meta) classifier. The experiments are based on five related datasets and the results show that the proposed meta‐learning framework provides higher prediction accuracy rates and lower type I/II errors when compared with the stacked generalization classifier and other three widely developed baselines, such as neural networks, decision trees, and logistic regression. Copyright © 2011 John Wiley & Sons, Ltd.


📜 SIMILAR VOLUMES


A semiparametric method for predicting b
✍ Ruey-Ching Hwang; K. F. Cheng; Jack C. Lee 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 699 KB

## Abstract Bankruptcy prediction methods based on a semiparametric logit model are proposed for simple random (prospective) and case–control (choice‐based; retrospective) data. The unknown parameters and prediction probabilities in the model are estimated by the local likelihood approach, and the

A meta-predictor framework for prefetchi
✍ Jean Christophe Beyler; Michael Klemm; Philippe Clauss; Michael Philippsen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB

## Abstract Dynamic optimizers modify the binary code of programs at runtime by profiling and optimizing certain aspects of the execution. We present a completely software‐based framework that dynamically optimizes programs for object‐based distributed shared memory (DSM) systems on clusters. In DS