TY - JOUR
T1 - Comparison of profit-based multi-objective approaches for feature selection in credit scoring
AU - Simumba, Naomi
AU - Okami, Suguru
AU - Kodaka, Akira
AU - Kohtake, Naohiko
N1 - Funding Information:
Funding: This work was supported by a JSPS KAKENHI Grant (Grant Number JP19H04100).
Publisher Copyright:
© 2021 by the authors. Licensee MDPI, Basel, Switzerland.
PY - 2021/9
Y1 - 2021/9
N2 - Feature selection is crucial to the credit-scoring process, allowing for the removal of irrel-evant variables with low predictive power. Conventional credit-scoring techniques treat this as a separate process wherein features are selected based on improving a single statistical measure, such as accuracy; however, recent research has focused on meaningful business parameters such as profit. More than one factor may be important to the selection process, making multi-objective optimization methods a necessity. However, the comparative performance of multi-objective methods has been known to vary depending on the test problem and specific implementation. This research employed a recent hybrid non-dominated sorting binary Grasshopper Optimization Algorithm and compared its performance on multi-objective feature selection for credit scoring to that of two pop-ular benchmark algorithms in this space. Further comparison is made to determine the impact of changing the profit-maximizing base classifiers on algorithm performance. Experiments demon-strate that, of the base classifiers used, the neural network classifier improved the profit-based measure and minimized the mean number of features in the population the most. Additionally, the NSBGOA algorithm gave relatively smaller hypervolumes and increased computational time across all base classifiers, while giving the highest mean objective values for the solutions. It is clear that the base classifier has a significant impact on the results of multi-objective optimization. Therefore, careful consideration should be made of the base classifier to use in the scenarios.
AB - Feature selection is crucial to the credit-scoring process, allowing for the removal of irrel-evant variables with low predictive power. Conventional credit-scoring techniques treat this as a separate process wherein features are selected based on improving a single statistical measure, such as accuracy; however, recent research has focused on meaningful business parameters such as profit. More than one factor may be important to the selection process, making multi-objective optimization methods a necessity. However, the comparative performance of multi-objective methods has been known to vary depending on the test problem and specific implementation. This research employed a recent hybrid non-dominated sorting binary Grasshopper Optimization Algorithm and compared its performance on multi-objective feature selection for credit scoring to that of two pop-ular benchmark algorithms in this space. Further comparison is made to determine the impact of changing the profit-maximizing base classifiers on algorithm performance. Experiments demon-strate that, of the base classifiers used, the neural network classifier improved the profit-based measure and minimized the mean number of features in the population the most. Additionally, the NSBGOA algorithm gave relatively smaller hypervolumes and increased computational time across all base classifiers, while giving the highest mean objective values for the solutions. It is clear that the base classifier has a significant impact on the results of multi-objective optimization. Therefore, careful consideration should be made of the base classifier to use in the scenarios.
KW - Credit evaluation
KW - Feature selection
KW - Multi-objective optimization
KW - Profit scoring
UR - http://www.scopus.com/inward/record.url?scp=85114209924&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85114209924&partnerID=8YFLogxK
U2 - 10.3390/a14090260
DO - 10.3390/a14090260
M3 - Article
AN - SCOPUS:85114209924
SN - 1999-4893
VL - 14
JO - Algorithms
JF - Algorithms
IS - 9
M1 - 260
ER -