dorsal/arxiv
View SchemaGraph Neural Network with One-side Edge Sampling for Fraud Detection
| Authors | Hoang Hiep Trieu |
|---|---|
| Categories | |
| ArXiv ID | 2601.06800vv1 |
| URL | https://arxiv.org/abs/2601.06800 |
| License | http://creativecommons.org/publicdomain/zero/1.0/ |
Abstract
Financial fraud is always a major problem in the field of finance, as it can cause significant consequences. As a result, many approaches have been designed to detect it, and lately Graph Neural Networks (GNNs) have been demonstrated as a competent candidate. However, when trained with a large amount of data, they are slow and computationally demanding. In addition, GNNs may need a deep architecture to detect complex fraud patterns, but doing so may make them suffer from problems such as over-fitting or over-smoothing. Over-fitting leads to reduced generalisation of the model on unseen data, while over-smoothing causes all nodes' features to converge to a fixed point due to excessive aggregation of information from neighbouring nodes. In this research, I propose an approach called One-Side Edge Sampling (OES) that can potentially reduce training duration as well as the effects of over-smoothing and over-fitting. The approach leverages predictive confidence in an edge classification task to sample edges from the input graph during a certain number of epochs. To explain why OES can alleviate over-smoothing, I perform a theoretical analysis of the proposed approach. In addition, to validate the effect of OES, I conduct experiments using different GNNs on two datasets. The results show that OES can empirically outperform backbone models in both shallow and deep architectures while also reducing training time.
{
"annotation_id": "29967024-15d9-4a78-b680-60085fe76b16",
"date_created": "2026-02-17T05:53:08.729000Z",
"date_modified": "2026-02-17T05:53:08.729000Z",
"file_hash": "50556094b05b8fb1c732f0980b059f36399fc3f595b74a7cc02fbc2e709e2997",
"private": false,
"record": {
"abstract": "Financial fraud is always a major problem in the field of finance, as it can cause significant consequences. As a result, many approaches have been designed to detect it, and lately Graph Neural Networks (GNNs) have been demonstrated as a competent candidate. However, when trained with a large amount of data, they are slow and computationally demanding. In addition, GNNs may need a deep architecture to detect complex fraud patterns, but doing so may make them suffer from problems such as over-fitting or over-smoothing. Over-fitting leads to reduced generalisation of the model on unseen data, while over-smoothing causes all nodes\u0027 features to converge to a fixed point due to excessive aggregation of information from neighbouring nodes. In this research, I propose an approach called One-Side Edge Sampling (OES) that can potentially reduce training duration as well as the effects of over-smoothing and over-fitting. The approach leverages predictive confidence in an edge classification task to sample edges from the input graph during a certain number of epochs. To explain why OES can alleviate over-smoothing, I perform a theoretical analysis of the proposed approach. In addition, to validate the effect of OES, I conduct experiments using different GNNs on two datasets. The results show that OES can empirically outperform backbone models in both shallow and deep architectures while also reducing training time.",
"arxiv_id": "2601.06800",
"authors": [
"Hoang Hiep Trieu"
],
"categories": [
"cs.LG",
"cs.AI"
],
"license": "http://creativecommons.org/publicdomain/zero/1.0/",
"title": "Graph Neural Network with One-side Edge Sampling for Fraud Detection",
"url": "https://arxiv.org/abs/2601.06800",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "2117ed6a-ff8a-41e2-8f8b-657d9a4e8b0f",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}