使用分类算法C4.5, Naïve贝叶斯,K-NN和随机森林确定信用资格的数据挖掘应用分析

Yessy Oktafriani, Gerry Firmansyah, Budi Tjahjono, Agung Mulyo Widodo
{"title":"使用分类算法C4.5, Naïve贝叶斯,K-NN和随机森林确定信用资格的数据挖掘应用分析","authors":"Yessy Oktafriani, Gerry Firmansyah, Budi Tjahjono, Agung Mulyo Widodo","doi":"10.59888/ajosh.v1i12.119","DOIUrl":null,"url":null,"abstract":"This study aims to enhance the credit evaluation process within Credit Union (CU) Karya Bersama Lestari (KABARI). The study leveraged four distinct algorithms, namely Decision Tree C4.5, Naive Bayes, K-Nearest Neighbors (K-NN), and Random Forest, to predict the suitability of extending loans to potential borrowers. Rapid Miner was employed as a tool to maximize accuracy by analyzing the Confusion matrix. Testing was conducted on a dataset consisting of 459 member loan submissions. The results of the analysis revealed that the K-Nearest Neighbors (K-NN) algorithm achieved the highest accuracy among the evaluated algorithms. Specifically, the Decision Tree algorithm demonstrated an accuracy rate of 95.65%, along with a precision and recall of 94.12%. The Naive Bayes algorithm achieved an accuracy rate of 95.65%, supported by precision and recall values of 100% and 88.24%, respectively. The K-Nearest Neighbors algorithm displayed the highest accuracy rate of 97.83%, accompanied by 100% precision and 94.12% recall. Meanwhile, the Random Forest algorithm exhibited an accuracy rate of 93.48%, complemented by precision and recall values of 100% and 82.35%, respectively. The study's conclusions bear relevance for refining loan approval processes and fostering improved lending practices within financial institutions like CU KABARI.","PeriodicalId":92175,"journal":{"name":"Asian journal of research in social sciences and humanities","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of Data Mining Applications for Determining Credit Eligibility Using Classification Algorithms C4.5, Naïve Bayes, K-NN, and Random Forest\",\"authors\":\"Yessy Oktafriani, Gerry Firmansyah, Budi Tjahjono, Agung Mulyo Widodo\",\"doi\":\"10.59888/ajosh.v1i12.119\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study aims to enhance the credit evaluation process within Credit Union (CU) Karya Bersama Lestari (KABARI). The study leveraged four distinct algorithms, namely Decision Tree C4.5, Naive Bayes, K-Nearest Neighbors (K-NN), and Random Forest, to predict the suitability of extending loans to potential borrowers. Rapid Miner was employed as a tool to maximize accuracy by analyzing the Confusion matrix. Testing was conducted on a dataset consisting of 459 member loan submissions. The results of the analysis revealed that the K-Nearest Neighbors (K-NN) algorithm achieved the highest accuracy among the evaluated algorithms. Specifically, the Decision Tree algorithm demonstrated an accuracy rate of 95.65%, along with a precision and recall of 94.12%. The Naive Bayes algorithm achieved an accuracy rate of 95.65%, supported by precision and recall values of 100% and 88.24%, respectively. The K-Nearest Neighbors algorithm displayed the highest accuracy rate of 97.83%, accompanied by 100% precision and 94.12% recall. Meanwhile, the Random Forest algorithm exhibited an accuracy rate of 93.48%, complemented by precision and recall values of 100% and 82.35%, respectively. The study's conclusions bear relevance for refining loan approval processes and fostering improved lending practices within financial institutions like CU KABARI.\",\"PeriodicalId\":92175,\"journal\":{\"name\":\"Asian journal of research in social sciences and humanities\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asian journal of research in social sciences and humanities\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.59888/ajosh.v1i12.119\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian journal of research in social sciences and humanities","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.59888/ajosh.v1i12.119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本研究旨在提高信用合作社(CU)卡里亚·贝尔萨马·莱斯塔里(KABARI)的信用评估过程。该研究利用了四种不同的算法,即决策树C4.5、朴素贝叶斯、k -近邻(K-NN)和随机森林,来预测向潜在借款人提供贷款的适用性。使用快速Miner作为工具,通过分析混淆矩阵来最大化准确性。测试是在包含459个成员贷款提交的数据集上进行的。分析结果表明,k -最近邻(K-NN)算法在评价算法中准确率最高。具体而言,决策树算法的准确率为95.65%,准确率和召回率为94.12%。朴素贝叶斯算法的准确率为95.65%,准确率为100%,召回率为88.24%。k近邻算法的准确率最高,为97.83%,准确率为100%,召回率为94.12%。随机森林算法的准确率为93.48%,准确率为100%,召回率为82.35%。该研究的结论对于完善贷款审批程序和促进像CU KABARI这样的金融机构改善贷款实践具有重要意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of Data Mining Applications for Determining Credit Eligibility Using Classification Algorithms C4.5, Naïve Bayes, K-NN, and Random Forest
This study aims to enhance the credit evaluation process within Credit Union (CU) Karya Bersama Lestari (KABARI). The study leveraged four distinct algorithms, namely Decision Tree C4.5, Naive Bayes, K-Nearest Neighbors (K-NN), and Random Forest, to predict the suitability of extending loans to potential borrowers. Rapid Miner was employed as a tool to maximize accuracy by analyzing the Confusion matrix. Testing was conducted on a dataset consisting of 459 member loan submissions. The results of the analysis revealed that the K-Nearest Neighbors (K-NN) algorithm achieved the highest accuracy among the evaluated algorithms. Specifically, the Decision Tree algorithm demonstrated an accuracy rate of 95.65%, along with a precision and recall of 94.12%. The Naive Bayes algorithm achieved an accuracy rate of 95.65%, supported by precision and recall values of 100% and 88.24%, respectively. The K-Nearest Neighbors algorithm displayed the highest accuracy rate of 97.83%, accompanied by 100% precision and 94.12% recall. Meanwhile, the Random Forest algorithm exhibited an accuracy rate of 93.48%, complemented by precision and recall values of 100% and 82.35%, respectively. The study's conclusions bear relevance for refining loan approval processes and fostering improved lending practices within financial institutions like CU KABARI.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信