Journal
SOFT COMPUTING
Volume 13, Issue 2, Pages 149-155Publisher
SPRINGER
DOI: 10.1007/s00500-008-0305-0
Keywords
Credit scoring; Direct search; Support vector machines; Genetic algorithm
Ask authors/readers for more resources
Support vector machines (SVM) is an effective tool for building good credit scoring models. However, the performance of the model depends on its parameters' setting. In this study, we use direct search method to optimize the SVM-based credit scoring model and compare it with other three parameters optimization methods, such as grid search, method based on design of experiment (DOE) and genetic algorithm (GA). Two real-world credit datasets are selected to demonstrate the effectiveness and feasibility of the method. The results show that the direct search method can find the effective model with high classification accuracy and good robustness and keep less dependency on the initial search space or point setting.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available