Machine Learning Based Approaches to Detect Loan Defaulters

被引:0
|
作者
Ramesha, Nishanth [1 ]
机构
[1] PESIT South Campus, Bengaluru, Karnataka, India
来源
ADVANCES IN COMPUTING AND DATA SCIENCES (ICACDS 2022), PT I | 2022年 / 1613卷
关键词
Loan default prediction; XGBoost; Random Forest; Logistic Regression; Machine learning; Ensemble techniques;
D O I
10.1007/978-3-031-12638-3_28
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Consumers acquire many loans from banks when they need money, and banks provide many low-interest rates offers to entice people to take out loans. However, if consumers do not pay their loans on time, the bank may incur a significant loss. The problem statement seeks to categorize whether people can repay their debt, preventing banks from incurring substantial losses. Defaulters can bankrupt banks due to large loan non-payment, resulting in a financial crisis in the country or for any bank that provides the loan. Before issuing a loan to a person, a comprehensive check is performed on their profile to ensure that they do not default, but it is still difficult to determine who will default and who will not. Because the number of individuals taking out loans is increasing year after year, a system to identify and handle this rising problem is urgently needed to find a solution. As the number of people taking out loans increases, so will the number of defaulters. There are a variety of classification machine learning techniques and deep learning approaches that may be used to solve the difficulties. The study's primary goal is to compare and contrast the Random Forest, Logistic Regression, and XGBoost models to see which one performs and provides the best accuracy.
引用
收藏
页码:336 / 347
页数:12
相关论文
共 50 条
  • [1] DISCRIMINANT OF LOAN APPLICANTS INTO DEFAULTERS AND NON-DEFAULTERS
    VENKATARAM, JV
    SUBRAMANIAN, R
    RAMANNA, R
    SUNDARARAJ, N
    MYSORE JOURNAL OF AGRICULTURAL SCIENCES, 1979, 13 (02): : 214 - 218
  • [2] Using Machine Learning Approaches to Detect Opponent Formation
    Asali, Ehsan
    Valipour, Mojtaba
    Zare, Nader
    Afshar, Ardavan
    Katebzadeh, MohammadReza
    Dastghaibyfard, G. H.
    2016 ARTIFICIAL INTELLIGENCE AND ROBOTICS (IRANOPEN), 2016, : 140 - 144
  • [3] A Comparison of Machine Learning Approaches to Detect Botnet Traffic
    Abraham, Brendan
    Mandya, Abhijith
    Bapat, Rohan
    Alali, Fatma
    Brown, Don E.
    Veeraraghavan, Malathi
    2018 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2018,
  • [4] Machine Learning Approaches to Detect DoS and Their Effect on WSNs Lifetime
    Wazirali, Raniyah
    Ahmad, Rami
    CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 70 (03): : 4921 - 4946
  • [5] A Machine Learning Based Approach to Detect Machine Learning Design Patterns
    Pan, Weitao
    Washizaki, Hironori
    Yoshioka, Nobukazu
    Fukazawa, Yoshiaki
    Khomh, Foutse
    Gueheneuc, Yann-Gael
    PROCEEDINGS OF THE 2023 30TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE, APSEC 2023, 2023, : 574 - 578
  • [6] A Review on Non-Invasive Multimodal Approaches to Detect Deception Based on Machine Learning Techniques
    Abdulridha, Fahad
    Albaker, Baraa M.
    JOURNAL OF ELECTRICAL SYSTEMS, 2024, 20 (04) : 619 - 633
  • [7] A machine learning based method to detect epilepsy
    Chakraborti S.
    Choudhary A.
    Singh A.
    Kumar R.
    Swetapadma A.
    International Journal of Information Technology, 2018, 10 (3) : 257 - 263
  • [8] INVESTIGATIONS ON CLASSIFICATION METHODS FOR LOAN APPLICATION BASED ON MACHINE LEARNING
    Wu, Mingli
    Huang, Yafei
    Duan, Jianyong
    PROCEEDINGS OF 2019 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), 2019, : 541 - 546
  • [9] Explainable prediction of loan default based on machine learning models
    Zhu X.
    Chu Q.
    Song X.
    Hu P.
    Peng L.
    Data Science and Management, 2023, 6 (03): : 123 - 133
  • [10] A comprehensive review of approaches to detect fatigue using machine learning techniques
    Hooda Rohit
    Joshi Vedant
    Shah Manan
    慢性疾病与转化医学(英文), 2022, 08 (01) : 26 - 35