The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Using generative adversarial networks for improving classification effectiveness in credit card fraud detection
Abstract
In the last years, the number of frauds in credit card-based online payments has grown dramatically, pushing banks and e-commerce organizations to implement automatic fraud detection systems, performing data mining on huge transaction logs. Machine learning seems to be one of the most promising solutions for spotting illicit transactions, by distinguishing fraudulent and non-fraudulent instances through the use of supervised binary classification systems properly trained from pre-screened sample datasets. However, in such a specific application domain, datasets available for training are strongly imbalanced, with the class of interest considerably less represented than the other. This significantly reduces the effectiveness of binary classifiers, undesirably biasing the results toward the prevailing class, while we are interested in the minority class. Oversampling the minority class has been adopted to alleviate this problem, but this method still has some drawbacks. Generative Adversarial Networks are general, flexible, and powerful generative deep learning models that have achieved success in producing convincingly real-looking images. We trained a GAN to output mimicked minority class examples, which were then merged with training data into an augmented training set so that the effectiveness of a classifier can be improved. Experiments show that a classifier trained on the augmented set outperforms the same classifier trained on the original data, especially as far the sensitivity is concerned, resulting in an effective fraud detection mechanism.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
GAN(Generative Adversarial Nets)
(2017) · Journal of Japan Society for Fuzzy Theory and Intelligent Informatics · doi:10.3156/jsoft.29.5_177_2 · Cited by 19,270
Representation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001
He, H., & Garcia, E. A. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.239 · Cited by 10,359
(2011) · Cited by 6,993
Borderline-SMOTE : A New Over-Sampling Method in Imbalanced Data Sets Learning
Han, H., Wang, W.-Y., & Mao, B.-H. (2005) · Lecture notes in computer science · doi:10.1007/11538059_91 · Cited by 4,331
The class imbalance problem: A systematic study1
Japkowicz, N., & Stephen, S. (2002) · Intelligent Data Analysis · doi:10.3233/ida-2002-6504 · Cited by 3,295
Combining Pattern Classifiers: Methods and Algorithms
Bagui, S. C. (2005) · Technometrics · doi:10.1198/tech.2005.s320 · Cited by 3,202
A Practical Guide to Training Restricted Boltzmann Machines
Hinton, G. E. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_32 · Cited by 2,852
Cited by
Deep Learning for Anomaly Detection: A Survey
Chalapathy, R., & Chawla, S. (2019) · arXiv · doi:10.48550/arxiv.1901.03407 · Cited by 1,240
“5 Fiore et al. [2017], Choi and Jang [2018] DNN Section 11.”
BackgroundFinancial Fraud: A Review of Anomaly Detection Techniques and Recent Advances
Hilal, W., Gadsden, S. A., & Yawney, J. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.116429 · Cited by 610
A review of deep learning with special emphasis on architectures, applications and recent trends
Sengupta, S., Basak, S., Saikia, P., Paul, S., Tsalavoutis, V., Atiah, F., Ravi, V., & Peters, A. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.105596 · Cited by 454
Taha, A. A., & Malebary, S. J. (2020) · IEEE Access · doi:10.1109/access.2020.2971354 · Cited by 443
Artificial intelligence in E-Commerce: a bibliometric study and literature review
Bawack, R. E., Wamba, S. F., Carillo, K. D. A., & Akter, S. (2022) · Electronic Markets · doi:10.1007/s12525-022-00537-z · Cited by 372
Generative Adversarial Active Learning for Unsupervised Outlier Detection
Liu, Y., Li, Z., Zhou, C., Jiang, Y., Sun, J., Wang, M., & He, X. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2905606 · Cited by 335
Conditional Wasserstein GAN-based oversampling of tabular data for imbalanced learning
Engelmann, J., & Lessmann, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114582 · Cited by 309
Zhang, X., Han, Y., Xu, W., & Wang, Q. (2021) · Information Sciences · doi:10.1016/j.ins.2019.05.023 · Cited by 283
Chen, P., Liu, H., Xin, R., Carval, T., Zhao, J., Xia, Y., & Zhao, Z. (2022) · The Computer Journal · doi:10.1093/comjnl/bxac085 · Cited by 128
Machine learning in NextG networks via generative adversarial networks
Ayanoglu, E., Davaslioglu, K., & Sagduyu, Y. E. (2022) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2022.3153004 · Cited by 55
Using Improved Conditional Generative Adversarial Networks to Detect Social Bots on Twitter
Wu, B., Liu, L., Yang, Y., Zheng, K., & Wang, X. (2020) · IEEE Access · doi:10.1109/access.2020.2975630 · Cited by 54
Self-Supervised Random Forest on Transformed Distribution for Anomaly Detection
Liu, J., Wang, H., Hang, H., Ma, S., Shen, X., & Shi, Y. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3348833 · Cited by 28
“Within the finance sector, anomaly detection plays a crucial role in fraud detection [7], [8], [9], [10], [11], [12].”
Fighting deepfakes using body language analysis
Yasrab, R., Jiang, W., & Riaz, A. (2021) · Forecasting · doi:10.3390/forecast3020020 · Cited by 20
Metadata
- Authors
- Fiore, U., De Santis, A., Perla, F., Zanetti, P., & Palmieri, F.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 479
- Pages
- 448-455
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2779931100
- Cited by
- 602
- References
- 32
- FWCI
- 17.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.