Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/14967
Title: | Credit Risk Customers Categorization with Random Forest Classifier Using Various Searching Techniques |
Authors: | Samprith, S Rajesh, T M Babu, Tina Nair, Rekha R Kishore, S |
Keywords: | Classifier Credit Risk Detection Methods Search Techniques |
Issue Date: | 2023 |
Publisher: | 2023 International Conference on Evolutionary Algorithms and Soft Computing Techniques, EASCT 2023 Institute of Electrical and Electronics Engineers Inc. |
Abstract: | Effective credit risk assessment holds significant importance for financial institutions and businesses extending credit to customers. It is crucial to evaluate customers' creditworthiness to minimize default risks and manage financial exposure. This study focuses on enhancing credit risk customer classification through optimized feature selection and classification techniques. The dataset is preprocessed using Synthetic Minority Oversampling Technique (SMOTE) to address class imbalance and enhance performance. Relevant features are then extracted utilizing Cfs Subset evaluation along with various search algorithms. The optimized features are subsequently employed for classification using the Random Forest (RF) classifier. Experimental results reveal that, in credit customer classification, Evolutionary, Tabu, and Scatter search algorithms combined with RF classifier demonstrate a commendable accuracy of 90.31%. The proposed framework also showcases comparable outcomes in terms of other performance metrics. This automated credit customer classification method proves to be highly effective in identifying fraudulent users. © 2023 IEEE. |
URI: | https://doi.org/10.1109/EASCT59475.2023.10392797 http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/14967 |
ISBN: | 9.79835E+12 |
Appears in Collections: | Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.