Bibliographic record
Abstract
Purpose The purpose of this paper is to use statistical techniques to mine and analyze suspicious transactions. With the increase in money laundering activities across various sectors in some of the world’s leading democracies, the ability to detect such transactions is gaining grounds with more urgency. Regulators and practitioners have been calling for an approach that can mine the large volume of unstructured data form suspicious money laundering transactions to inform public policies. Design/methodology/approach By deducing from the results of empirical studies in the field of money laundering detection, this paper presented an overview of data mining technology for detecting suspicious transactions. Findings After chronicling the data mining process, the paper delves into an analysis of the statistical approaches that can be used to differentiate between legitimate and suspicious money laundering transactions. The different stages of the data mining process are carefully explained in relation to their application to anti-money laundering compliance. The results indicate that statistical data mining methodology is a very efficient and useful technique to detect suspicious transactions. Practical implications The paper is of relevance to regulators and the financial service sector. A discussion of how data can be mined to facilitate statistical analysis can be used to inform regulatory policies on the detection and prevention of money laundering activities in the financial service sector. Originality/value The paper discuss approaches that illustrate how analysts can use statistical techniques to analyze data for suspicious money laundering transactions
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.014 | 0.076 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.009 | 0.011 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.004 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".