Papers › A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection

A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection

18 Feb 2025arXiv:2502.13308archive 2025-07-28

Junjun Pan, Yixin Liu, Xin Zheng, Yizhen Zheng, Alan Wee-Chung Liew, Fuyi Li, Shirui Pan

Graph fraud detection (GFD) has rapidly advanced in protecting online services by identifying malicious fraudsters. Recent supervised GFD research highlights that heterophilic connections between fraudsters and users can greatly impact detection performance, since fraudsters tend to camouflage themselves by building more connections to benign users. Despite the promising performance of supervised GFD methods, the reliance on labels limits their applications to unsupervised scenarios; Additionally, accurately capturing complex and diverse heterophily patterns without labels poses a further challenge. To fill the gap, we propose a Heterophily-guided Unsupervised Graph fraud dEtection approach (HUGE) for unsupervised GFD, which contains two essential components: a heterophily estimation module and an alignment-based fraud detection module. In the heterophily estimation module, we design a novel label-free heterophily metric called HALO, which captures the critical graph properties for GFD, enabling its outstanding ability to estimate heterophily from node attributes. In the alignment-based fraud detection module, we develop a joint MLP-GNN architecture with ranking loss and asymmetric alignment loss. The ranking loss aligns the predicted fraud score with the relative order of HALO, providing an extra robustness guarantee by comparing heterophily among non-adjacent nodes. Moreover, the asymmetric alignment loss effectively utilizes structural information while alleviating the feature-smooth effects of GNNs.Extensive experiments on 6 datasets demonstrate that HUGE significantly outperforms competitors, showcasing its effectiveness and robustness. The source code of HUGE is at https://github.com/CampanulaBells/HUGE-GAD.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2502.13308")

Code

Syntology Ran 1 of 10 code samples harvested from 1 repository linked to this paper; 9 have no recorded run. Of those that ran: 1 ran · violated contract.

By repository: official repository: 10 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

campanulabells/huge-gad officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 1 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · violated contract
9unverified

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from campanulabells/huge-gad. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

str2bool campanulabells/huge-gad/modules/utils.py official repository ran · violated contract MIT (permissive) · 7c508037b40522af · report
compute_S campanulabells/huge-gad/modules/ranking.py official repository unverified MIT (permissive) · 643374e8f7fa522b · report
compute_s campanulabells/huge-gad/modules/ranking.py official repository unverified MIT (permissive) · ccfccd16dec907c5 · report
compute_sim campanulabells/huge-gad/modules/loss.py official repository unverified MIT (permissive) · 5daea2629cef25a2 · report
halo campanulabells/huge-gad/modules/utils.py official repository unverified MIT (permissive) · f60a75781fb0f08e · report
neighbor_KLD campanulabells/huge-gad/modules/loss.py official repository unverified MIT (permissive) · 69ed13a02967fac8 · report
neighbor_KLD_batch campanulabells/huge-gad/modules/loss.py official repository unverified MIT (permissive) · 3a69846bbda3da77 · report
node_heterophily campanulabells/huge-gad/modules/node_heterophily.py official repository unverified MIT (permissive) · 9bf0fb65362dd5ce · report
prc_auc_score campanulabells/huge-gad/modules/utils.py official repository unverified MIT (permissive) · 65e775517ef33e12 · report
rank_loss campanulabells/huge-gad/modules/ranking.py official repository unverified MIT (permissive) · 233b82f4f3888b45 · report

Tasks

Fraud Detection

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections