K-Means Clustering Method to Make Credit Payment Groupinhg Efficient

Credit payment management is one of the main challenges in the financial sector, especially in grouping customers based on risk and payment patterns. This study aims to evaluate the K-Means Clustering method in improving the efficiency of credit payment data clustering. The dataset used includes information on payment history, loan amount, tenor, and credit status from financial institutions. The research approach involves data processing stages, application of the K-Means algorithm, and evaluation of results using the Davies-Bouldin Index and Silhouette Score metrics. The results of the analysis show that the K-Means method is effective in identifying customer payment patterns and dividing them into three main clusters: high, medium, and low risk. In addition, this study found that determining the optimal number of clusters using the Elbow Method can improve the accuracy of the clustering results. The resulting model makes a significant contribution to credit risk management, helping financial institutions make strategic decisions related to credit policies and risk mitigation. This study offers practical implications, including increased operational efficiency and predictive ability against potential bad debts. Further studies are recommended to integrate this method with other algorithms to improve the performance of large-scale data analysis.

Authors

Institutions

Publication Details

Journal
Journal of Artificial Intelligence and Engineering Applications (JAIEA)
Published
2025-02-15
DOI
https://doi.org/10.59934/jaiea.v4i2.815
Primary Topic
Data Mining and Machine Learning Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

K-Means Clustering Method to Make Credit Payment Groupinhg Efficient

Dodi Solihudin, Nana Suarna, Irfan Ali, Siti Nur Illah
1 links
Journal of Artificial Intelligence and Engineering Applications (JAIEA)
Data Mining and Machine Learning Applications
article

K-Means Clustering Method to Make Credit Payment Groupinhg Efficient

Dodi Solihudin, Nana Suarna, Irfan Ali, Siti Nur Illah
article en

Abstract

Credit payment management is one of the main challenges in the financial sector, especially in grouping customers based on risk and payment patterns. This study aims to evaluate the K-Means Clustering method in improving the efficiency of credit payment data clustering. The dataset used includes information on payment history, loan amount, tenor, and credit status from financial institutions. The research approach involves data processing stages, application of the K-Means algorithm, and evaluation of results using the Davies-Bouldin Index and Silhouette Score metrics. The results of the analysis show that the K-Means method is effective in identifying customer payment patterns and dividing them into three main clusters: high, medium, and low risk. In addition, this study found that determining the optimal number of clusters using the Elbow Method can improve the accuracy of the clustering results. The resulting model makes a significant contribution to credit risk management, helping financial institutions make strategic decisions related to credit policies and risk mitigation. This study offers practical implications, including increased operational efficiency and predictive ability against potential bad debts. Further studies are recommended to integrate this method with other algorithms to improve the performance of large-scale data analysis.

Journal of Artificial Intelligence and Engineering Applications (JAIEA)Vol. 4(2)
Institute of Biology of Komi Scientific Centre (RU)
Openalex Percentile: Top 97%
Data Mining and Machine Learning Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.