상세 보기
Predicting Corporate Bankruptcy using Simulated Annealing-based Random Forests
- 박호연;
- 김경재
초록
Predicting a company's financial bankruptcy is traditionally one of the most crucial forecasting problems in business analytics. In previous studies, prediction models have been proposed by applying or combining statistical and machine learning-based techniques. In this paper, we propose a novel intelligent prediction model based on the simulated annealing which is one of the well-known optimization techniques. The simulated annealing is known to have comparable optimization performance to the genetic algorithms. Nevertheless, since there has been little research on the prediction and classification of business decision-making problems using the simulated annealing, it is meaningful to confirm the usefulness of the proposed model in business analytics. In this study, we use the combined model of simulated annealing and machine learning to select the input features of the bankruptcy prediction model. Typical types of combining optimization and machine learning techniques are feature selection, feature weighting, and instance selection. This study proposes a combining model for feature selection, which has been studied the most. In order to confirm the superiority of the proposed model in this study, we apply the real-world financial data of the Korean companies and analyze the results. The results show that the predictive accuracy of the proposed model is better than that of the naïve model. Notably, the performance is significantly improved as compared with the traditional decision tree, random forests, artificial neural network, SVM, and logistic regression analysis.
키워드
- 제목
- Predicting Corporate Bankruptcy using Simulated Annealing-based Random Forests
- 제목 (타언어)
- Predicting Corporate Bankruptcy using Simulated Annealing-based Random Forests
- 저자
- 박호연; 김경재
- 발행일
- 2018-12
- 저널명
- 지능정보연구
- 권
- 24
- 호
- 4
- 페이지
- 155 ~ 170
- 언어
- ENG
- 출판사
- 한국지능정보시스템학회
- 발행국가
- 대한민국
- 분량
- 16 페이지
- ISSN
- E 2288-4882
P 2288-4866