MétaCan
Menu
Back to cohort
Record W3011219038 · doi:10.1109/ai4i46381.2019.00030

Short Paper: Credit Card Fraud Detection using LightGBM with Asymmetric Error Control

2019· article· en· W3011219038 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicImbalanced Data Classification Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsCredit cardCredit card fraudComputer scienceConstant false alarm rateFalse alarmConfidentialityControl (management)Error detection and correctionComputer securityWord error rateData miningALARMArtificial intelligenceAlgorithmEngineeringWorld Wide Web

Abstract

fetched live from OpenAlex

Credit card frauds, while only account for about 0.1% of all card transactions, resulting in huge financial and reputational losses. Challenges of detecting credit card frauds are from the imbalanced nature of the recorded data, the need for controlling the trade-off between miss detection and false alarm, and incomplete information due to confidentiality requirements. In this paper, we propose an innovative fraud detection framework implementing the LightGBM method under the Neyman-Pearson paradigm, which enables asymmetric error control. Performance measurement metrics are also introduced to evaluate different classification frameworks. We can successfully keep the miss detection rate under the desired upper bound and control false alarm at the same time.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.893
Threshold uncertainty score0.507

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.016
GPT teacher head0.246
Teacher spread0.230 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it