Predicting bankruptcy using recursive partitioning and a realistically proportioned data set

Predicting bankruptcy using recursive partitioning and a realistically proportioned data set

0.00 Avg rating0 Votes
Article ID: iaor20013115
Country: United Kingdom
Volume: 19
Issue: 3
Start Page Number: 219
End Page Number: 230
Publication Date: Apr 2000
Journal: International Journal of Forecasting
Authors: ,
Keywords: time series & forecasting methods, financial
Abstract:

Auditors must assess their clients' ability to function as a going concern for at least the year following the financial statement date. The audit profession has been severely criticized for failure to ‘blow the whistle’ in numerous highly visible bankruptcies that occurred shortly after unmodified audit opinions were issued. Financial distress indicators examined in this study are one mechanism for making such assessments. This study measures and compares the predictive accuracy of an easily implemented two-variable bankruptcy model originally developed using recursive partitioning on an equally proportioned data set of 202 firms. In this study, we test the predictive accuracy of this model, as well as previously developed logit and neural network models, using a realistically proportioned set of 14,212 firms' financial data covering the period 1981–1990. The previously developed recursive partitioning model had an overall accuracy for all firms ranging from 95 to 97% which outperformed both the logit model at 93 to 94% and the neural network model at 86 to 91%. The recursive partitioning model predicted the bankrupt firms with 33–58% accuracy. A sensitivity analysis of recursive partitioning cutting points indicated that a newly specified model could achieve an all firm and a bankrupt firm predictive accuracy of approximately 85%. Auditors will be interested in the Type I and Type II error tradeoffs revealed in a detailed sensitivity table for this easily implemented model.

Reviews

Required fields are marked *. Your email address will not be published.