Multi-Class Mobile Money Service Financial Fraud Detection by Integrating Supervised Learning with Adversarial Autoencoders
Bibliographic record
Abstract
Given the actual volume and speed of financial transactions, financial fraud detection systems are constantly evolving based on new computational intelligence algorithms. Therefore, transaction monitoring and analysis prevent monetary losses caused by fraudsters. Since the fraud detection process is a labor-intensive task for human auditors given the huge amount of daily transactions processed by financial services information systems. Credit card is the financial product most explored in the financial fraud detection literature, while mobile money service is becoming a popular option for payments, fraud detection for such financial product has not yet been deeply explored. Therefore, it is interesting to optimize the auditing process and test new quantitative techniques, such as deep learning, to support human auditors before double-checking a suspicious transaction. Thus, we propose an integration of adversarial autoencoders and machine learning methods to perform an objective classification among three transaction types: regular, local, and global anomaly. The integration consists of using the autoencoder's generated latent vectors as features for the supervised learning algorithms. The experiments considered different latent vector space forms concerning their dimensionality and the clusters generated by a prior Gaussian mixture. The results show that some classifiers may accept latent characteristics well, getting better or similar performance when using all the original characteristics.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".