Approaches proposing solution methods
| References Authors | Solution methods Credit scoring models |
|---|---|
| Sinha and Zhao (2008) | LR, DT, NB, k-NN, ANN, SVM and Decision Table |
| Antonakis and Sfakianakis (2009) | CT, NB, LD, LR, k-NN and ANN |
| Finlay (2009) | GA |
| Ince and Aktan (2009) | DA, LR, CART and ANN |
| Šušteršič et al. (2009) | GA, LR, EBP and ANN |
| Finlay (2010) | GA |
| Liu and Bo (2011) | SA, GA and NB |
| Vukovic et al. (2012) | GA, k-NN and CBR |
| Bravo et al. (2013) | LR and KDD |
| Kruppa et al. (2013) | RF, LR and k-NN |
| Verbraken et al. (2014) | LR, EMP and ANN |
| Kozeny (2015) | GA |
| Řez áč (2015) | MCS and ESIS2 Algorithm |
| Serrano-Cinca and Gutié rrez-Nieto (2016) | DT, MR and IRR |
| Krichene (2017) | NB and ANN |
| Maldonado et al. (2017) | SVM |
| Bastani et al. (2019) | LR, IHT, IRR and SMOTE |
| Çi ǧş ar and Ü nal (2019) | LR, RF, NB, MP, J48 Algorithm and Bayesian Networks |
| Kozodoi et al. (2019) | EMP and NSGA-II Algorithm |
| Sariannidis et al. (2020) | LR, NB, DT, RF, SVC, k-NN and LSVC |
| Li and Chen (2020) | DT, LR, RF, NB, ANN, SVM, XGBoost, AdaBoost and LightGBM |
| Nalić and Martinovic (2020) | GLC and SVM |
| Trivedi (2020) | RF, DT, NB and SVM |
| Ashofteh and Bravo (2021) | LR, RF, ANN and SVM |
| Carta et al. (2021) | GB, AB, RF, DT and MP |
| Dastile and Celik (2021) | CNNs |
| Djeundje et al. (2021) | LR, RR, PCA, XGBoost and LASSO Regression |
| Kang et al. (2021) | RF, DT, XGBoost, LightGBM and Borderline-SMOTE |
| Laborda and Ryoo (2021) | LR, RA, SVM and k-NN |
| Li et al. (2021) | DT, LR, RF, GB and ML-LightGBM |
| Roa et al. (2021) | EMP and SGB |
| Roy and Shaw (2021a) | AHP and TOPSIS |
| Roy and Shaw (2021b) | BWM and TOPSIS |
| Xia et al. (2021) | LR, RF, CatBoost and XGBoost |
| Kozodoi et al. (2022) | LR, ANN, RF, XGBoost and EMP |
| Roy and Shaw (2022) | BWM and TOPSIS |
| References | Solution methods |
|---|---|
| LR, DT, NB, k-NN, ANN, SVM and Decision Table | |
| CT, NB, LD, LR, k-NN and ANN | |
| GA | |
| DA, LR, CART and ANN | |
| GA, LR, | |
| GA | |
| SA, GA and NB | |
| GA, k-NN and CBR | |
| LR and KDD | |
| RF, LR and k-NN | |
| LR, EMP and ANN | |
| GA | |
| MCS and ESIS2 Algorithm | |
| DT, MR and IRR | |
| NB and ANN | |
| SVM | |
| LR, IHT, IRR and SMOTE | |
| LR, RF, NB, MP, J48 Algorithm and Bayesian Networks | |
| EMP and NSGA-II Algorithm | |
| LR, NB, DT, RF, SVC, k-NN and LSVC | |
| DT, LR, RF, NB, ANN, SVM, XGBoost, AdaBoost and LightGBM | |
| GLC and SVM | |
| RF, DT, NB and SVM | |
| LR, RF, ANN and SVM | |
| GB, AB, RF, DT and MP | |
| CNNs | |
| LR, RR, PCA, XGBoost and LASSO Regression | |
| RF, DT, XGBoost, LightGBM and Borderline-SMOTE | |
| LR, RA, SVM and k-NN | |
| DT, LR, RF, GB and ML-LightGBM | |
| EMP and SGB | |
| AHP and TOPSIS | |
| BWM and TOPSIS | |
| LR, RF, CatBoost and XGBoost | |
| LR, ANN, RF, XGBoost and EMP | |
| BWM and TOPSIS |
Note(s): Referenced abbreviations: NB – Naive Bayes; DT – Decision Trees; RF – Random Forests; VS – Variable Selection; RR – Ridge Regression; GB – Gradient Boosting; GA – Genetic Algorithm; AB – Adaptive Boosting; CT – Classification Trees; LR – Logistic Regression; LD – Linear Discriminant; SA – Simulated Annealing; DA – Discriminant Analysis; MP – Multilayer Perceptron; k-NN – k-Nearest; Neighbors; IRR – Internal Rate of Return; BWM – Best-Worst Method; CBR – Case-Based Reasoning; MP – Multilayered Perceptron; MR – Multivariate Regression; SVM – Support Vector Machine; MCS – Monte Carlo Simulations; EMP – Expected Maximum Profit; SVC – Support Vector Clustering; ANN – Artificial Neural Networks; SGB – Stochastic Gradient Boosting; AHP – Analytic Hierarchy Process; IHT – Instance Hardness Threshold; PCA – Principal Component Analysis; XGBoost – Extreme Gradient Boosting; GLC – Generalised Linear Classification; CNNs – Convolutional Neural Networks; CatBoost – Categorical Gradient Boosting; KDD – Knowledge Discovery in Databases; ML-LightGBM – Light Gradient Boosting Machines; CART – Classification and Regression Trees; SMOTE – Synthetic Minority Oversampling Technique; LASSO – Least Absolute Shrinkage and Selection Operator; TOPSIS – Technique for Order of Preference by Similarity to Ideal Solution; Borderline-SMOTE – Modified Synthetic Minority Oversampling Technique
Source(s): Own elaboration
Sharing content requires targeting cookies to be enabled. Please update your cookie preferences to use this feature.