Credit Card Fraud Detection Using Random Forest and K-Nearest Neighbors (KNN) Algorithms

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we explored the application of both the Random Forest and K-Nearest Neighbors (KNN) algorithms for fraud detection. Fraudulent activities pose significant threats to various industries, making their detection crucial. We reviewed related works on fraud detection, highlighting the effectiveness of both the Random Forest and KNN methods. We proposed a system utilizing a combination of Random Forest and KNN models for credit card fraud detection, detailing its architecture and methodology. The system preprocesses and splits data, trains the models, and evaluates their performance on a testing set. We analyzed the results, demonstrating the accuracy, robustness, and scalability of the proposed system. Additionally, we presented data on the most common hours for fraudulent transactions and the top jobs associated with them. Overall, this study emphasizes the efficacy of utilizing both Random Forest and KNN algorithms in mitigating the risks associated with fraud and offers a valuable tool for safeguarding against financial malfeasance.

Cite

CITATION STYLE

APA

Alhabib, A. A., Alasiri, A. F., Alharbi, M. B., Ahmad, S., & Eljialy, A. E. M. (2025). Credit Card Fraud Detection Using Random Forest and K-Nearest Neighbors (KNN) Algorithms. In Lecture Notes in Networks and Systems (Vol. 1128 LNNS, pp. 383–395). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-981-97-7371-8_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free