mlsanityData to 7 Oct 2026

Let Relations Speak: An End-to-End LLM-GNN Soft Prompt Framework for Fraud Detection

arXiv 2605.28524 ↗First posted 27 May 2026cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

In recent years, Large Language Models (LLMs) have shown great capability in processing graph tasks such as fraud detection. However, most existing methods rely heavily on rich text attributes, which poses difficulties for this domain due to the lack of textual data. Although some pioneering methods attempt to overcome it, their textualization of graph structures via hard prompts easily leads to feature distortion. Additionally, fraud detection often exhibits multi-relational complexity, where current methods struggle to capture this deep semantic information. To address these challenges, we propose LLM-GNN Soft Prompt Framework (LGSPF). Specifically, LGSPF bridges the graph structure and semantic space using soft prompt to eliminate reliance on text. We further introduce a parallel Graph Neural Network (GNN) encoder to translate multi-relational topologies into graph tokens for fine-grained LLM fraud comprehension. Through end-to-end optimization, LGSPF enhances deep semantic alignment between LLM and GNN. Experiments across diverse fraud detection benchmarks demonstrate our method achieves state-of-the-art performance. Moreover, we further validate the contribution of LGSPF on enhancing the semantic interpretability of fraud behaviors.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 49 references that are in the map. First posted on arXiv 27 May 2026.

Builds on

27 of 49 references.

References · 27

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2017Inductive Representation Learning on Large Graphscited by 6,284
  5. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  6. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  7. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  8. 2021A Comprehensive Survey on Graph Anomaly Detection with Deep Learningcited by 230
  9. 2023Language is All a Graph Needscited by 219
  10. 2022Rethinking Graph Neural Networks for Anomaly Detectioncited by 185
  11. 2024LLaGA: Large Language and Graph Assistantcited by 177
  12. 2023LLMRec: Large Language Models with Graph Augmentation for Recommendationcited by 171
15 more
  1. 2013From Amateurs to Connoisseurs: Modeling the Evolution of User Expertise through Online Reviewscited by 107
  2. 2020Heterogeneous Graph Neural Networks for Malicious Account Detectioncited by 95
  3. 2023InstructMol: Multi-Modal Integration for Building a Versatile and Reliable Molecular Assistant in Drug Discoverycited by 86
  4. 2023A Survey of Graph Meets Large Language Model: Progress and Future Directionscited by 84
  5. 2024GraphTranslator: Aligning Graph Model to Large Language Model for Open-ended Taskscited by 63
  6. 2021E-GraphSAGE: A Graph Neural Network based Intrusion Detection System for IoTcited by 55
  7. 2023Graph-Aware Language Model Pre-Training on a Large Graph Corpus Can Help Multiple Graph Applicationscited by 33
  8. 2024Semi-supervised Credit Card Fraud Detection via Attribute-Driven Graph Representationcited by 25
  9. 2024Can LLMs Convert Graphs to Text-Attributed Graphs?cited by 19
  10. 2020Robust Spammer Detection by Nash Reinforcement Learningcited by 17
  11. 2025DGP: A Dual-Granularity Prompting Framework for Fraud Detection with Graph-Enhanced LLMscited by 11
  12. 2025Can LLMs Find Fraudsters? Multi-level LLM Enhanced Graph Fraud Detectioncited by 10
  13. 2025Graph-R1: Incentivizing the Zero-Shot Graph Learning Capability in LLMs via Explicit Reasoningcited by 6
  14. 2025When Structure Doesn't Help: LLMs Do Not Read Text-Attributed Graphs as Effectively as We Expectedcited by 3
  15. 2025A Survey of Large Language Models for Data Challenges in Graphscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.