MétaCan
Menu
Back to cohort

Telecom Fraud Detection via Imbalanced Graph Learning

2022· article· en· W4360996447 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 Toronto
FundersNational Natural Science Foundation of China
KeywordsComputer scienceGraphNode (physics)Multilayer perceptronDetectorData miningArtificial neural networkArtificial intelligenceComputer networkTelecommunicationsTheoretical computer scienceEngineering

Abstract

fetched live from OpenAlex

In recent years, an increasing number of telecom frauds have caused huge losses to people around the world. Graph neural network(GNN) brings new possibilities for telecom fraud detection. However, due to the existence of the imbalance problem in the graph, it is difficult for general GNN models to detect a small number of positive samples. To address this problem, we design a new GNN-based fraud detector. First, we transform the node features with a multilayer perceptron. Subsequently, a reinforcement learning-based neighbor sampling strategy is designed to balance different classes of node neighbors. Then the node features are aggregated using GNN, while the focal loss function is used to measure the model error. We conducted experiments on two real-world telecom fraud datasets, and the results show that the proposed method does have competitive performance, especially for the graph imbalance problem.

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.941
Threshold uncertainty score0.426

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.0010.000
Scholarly communication0.0000.000
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.009
GPT teacher head0.223
Teacher spread0.215 · 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