TL;DR
This paper introduces DGP, a dual-granularity prompting framework that enhances fraud detection with graph-enhanced LLMs by effectively summarizing neighbor information to improve performance and manage token budgets.
Contribution
DGP is the first to apply dual-granularity prompting with tailored summarization strategies for heterogeneous graphs in fraud detection, addressing information overload issues.
Findings
DGP improves fraud detection AUPRC by up to 6.8%.
DGP effectively manages token budgets while maintaining high performance.
Experiments on public and industrial datasets validate DGP's effectiveness.
Abstract
Real-world fraud detection applications benefit from graph learning techniques that jointly exploit node features, often rich in textual data, and graph structural information. Recently, Graph-Enhanced LLMs emerge as a promising graph learning approach that converts graph information into prompts, exploiting LLMs' ability to reason over both textual and structural information. Among them, text-only prompting, which converts graph information to prompts consisting solely of text tokens, offers a solution that relies only on LLM tuning without requiring additional graph-specific encoders. However, text-only prompting struggles on heterogeneous fraud-detection graphs: multi-hop relations expand exponentially with each additional hop, leading to rapidly growing neighborhoods associated with dense textual information. These neighborhoods may overwhelm the model with long, irrelevant content…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
