mlsanityData to 7 Oct 2026

Utilizing GANs for Fraud Detection: Model Training with Synthetic Transaction Data

arXiv 2402.09830 ↗First posted 15 Feb 2024cs.LG cs.AI cs.CEcited by 5

Not on the map. Why?

Abstract (arXiv)

Anomaly detection is a critical challenge across various research domains, aiming to identify instances that deviate from normal data distributions. This paper explores the application of Generative Adversarial Networks (GANs) in fraud detection, comparing their advantages with traditional methods. GANs, a type of Artificial Neural Network (ANN), have shown promise in modeling complex data distributions, making them effective tools for anomaly detection. The paper systematically describes the principles of GANs and their derivative models, emphasizing their application in fraud detection across different datasets. And by building a collection of adversarial verification graphs, we will effectively prevent fraud caused by bots or automated systems and ensure that the users in the transaction are real. The objective of the experiment is to design and implement a fake face verification code and fraud detection system based on Generative Adversarial network (GANs) algorithm to enhance the security of the transaction process.The study demonstrates the potential of GANs in enhancing transaction security through deep learning techniques.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 3 of its 13 references that are in the map. First posted on arXiv 15 Feb 2024.

Builds on

3 of 13 references.

References · 3

  1. 2023Integration and Performance Analysis of Artificial Intelligence and Computer Vision Based on Deep Learning Algorithmscited by 19
  2. 2024Semantic Similarity Matching for Patent Documents Using Ensemble BERT-related Model and Novel Text Processing Methodcited by 18
  3. 2024Application analysis of ai technology combined with spiral CT scanning in early lung cancer screeningcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 1; 2026: 1.

5 papers.