Unsupervised Graph Modeling for Anomaly Detection in Accounting Subject Relationships

• URL: http://arxiv.org/abs/2604.26216v1
• Date: Wed, 29 Apr 2026 01:44:43 GMT
• Title: Unsupervised Graph Modeling for Anomaly Detection in Accounting Subject Relationships
• Abstract summary: This paper addresses the problem of anomaly detection in accounting subject association structures.<n>It proposes a structured modeling and unsupervised discriminant framework based on graph neural networks.
• Score: 6.696927406719471
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper addresses the problem of anomaly detection in accounting subject association structures, proposing a structured modeling and unsupervised discriminant framework based on graph neural networks. This framework is used to mine stable correspondences between subjects and identify structural deviations from general ledger details and voucher entries. The method first abstracts accounting subjects as graph nodes, and the co-occurrence and debit/credit correspondence of subjects in the same business record are abstracted as weighted edges. The edge weights are characterized by statistical measures such as co-occurrence frequency or amount aggregation, thus forming a period-level accounting subject association graph. In the representation learning stage, a message passing mechanism is used to fuse the node's own attributes and neighborhood context to obtain node embeddings containing structural information. In the anomaly detection stage, the rationality of subject pair connections is estimated through a relation reconstruction decoder, and edge-level anomaly scores are defined based on the degree of deviation in reconstruction probabilities. These scores are then aggregated to obtain node-level risk ranking and local anomaly localization. This framework can simultaneously capture local substructure anomalies and cross-community anomaly connections without relying on anomaly labeling, outputting traceable subject pair risk clues. Comparative experiments demonstrate more stable comprehensive discriminant capabilities and higher top-ranking accuracy.

Related papers

• Towards Anomaly Detection on Relational Data [51.473064583839296]
  We propose a reconstruction-based framework that captures anomalies from both attribute and relational edge reconstruction.<n>RelAD consistently outperforms other baselines while achieving competitive efficiency.
  arXiv  Detail & Related papers  (2026-06-17T02:36:32Z)
• Graph-Based Financial Fraud Detection with Calibrated Risk Scoring and Structural Regularization [8.94945137673605]
  This paper proposes a graph neural network representation learning and risk discrimination framework for financial transaction fraud prevention.<n>It integrates transaction records and identity information into node attributes and constructs a transaction graph based on shared attributes and interaction consistency.<n> Experiments are conducted on a publicly available financial transaction dataset.
  arXiv  Detail & Related papers  (2026-05-12T21:52:24Z)
• Beyond Nodes vs. Edges: A Multi-View Fusion Framework for Provenance-Based Intrusion Detection [6.343815622517112]
  PROVfusion is a multi-view anomaly fusion framework for provenance-based intrusion detection.<n>It fuses heterogeneous anomaly signals through lightweight fusion schemes and determines the final anomaly decisions through a voting-based integration process.<n>Experiments on nine widely used benchmark entity datasets demonstrate that PROVfusion achieves higher detection accuracy and lower false-positive rates than single node- and edge-centric baselines.
  arXiv  Detail & Related papers  (2026-04-16T06:40:50Z)
• Hierarchical Reference Sets for Robust Unsupervised Detection of Scattered and Clustered Outliers [8.21087649188741]
  Clustered outliers can be easily mistaken for normal behavior because of their relatively high local density.<n>We propose a novel outlier detection paradigm that leverages the natural neighboring relationships using graph structures.<n>Our approach enables the effective recognition of scattered outliers without interference from clustered anomalies.
  arXiv  Detail & Related papers  (2026-03-13T09:48:20Z)
• Multi-Agent Debate: A Unified Agentic Framework for Tabular Anomaly Detection [7.807411603618987]
  Multi-Agent Debating framework (MAD) treats disagreement as a first-class signal.<n> MAD produces a normalized anomaly score, confidence, and structured evidence, augmented by a large language model (LLM)-based critic.<n>We show how conformal calibration can wrap the debated score to control false positives under exchangeability.
  arXiv  Detail & Related papers  (2026-02-15T17:44:32Z)
• Topology Identification and Inference over Graphs [61.06365536861156]
  Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks.<n>This chapter provides an overview of graph topology identification and statistical inference methods for multidimensional data.
  arXiv  Detail & Related papers  (2025-12-11T00:47:09Z)
• Generative Modeling and Decision Fusion for Unknown Event Detection and Classification Using Synchrophasor Data [9.871276314615447]
  This paper proposes a novel framework that integrates generative modeling, sliding-window temporal processing, and decision fusion to achieve robust event detection and classification.<n> Experimental results demonstrate state-of-the-art accuracy, surpassing machine learning, deep learning, and envelope-based baselines.
  arXiv  Detail & Related papers  (2025-09-26T18:04:03Z)
• GTHNA: Local-global Graph Transformer with Memory Reconstruction for Holistic Node Anomaly Evaluation [7.287914649294607]
  Anomaly detection in graph-structured data is an inherently challenging problem.<n>Existing methods, such as those based on graph convolutional networks (GCNs), often suffer from over-smoothing.<n>We propose a novel and holistic anomaly evaluation framework that integrates three key components.
  arXiv  Detail & Related papers  (2025-09-13T15:52:16Z)
• BOURNE: Bootstrapped Self-supervised Learning Framework for Unified Graph Anomaly Detection [50.26074811655596]
  We propose a novel unified graph anomaly detection framework based on bootstrapped self-supervised learning (named BOURNE) By swapping the context embeddings between nodes and edges, we enable the mutual detection of node and edge anomalies. BOURNE can eliminate the need for negative sampling, thereby enhancing its efficiency in handling large graphs.
  arXiv  Detail & Related papers  (2023-07-28T00:44:57Z)
• Non-Asymptotic Performance of Social Machine Learning Under Limited Data [45.48644055449902]
  This paper studies the probability of error associated with the social machine learning framework. It addresses the problem of classifying a stream of unlabeled data in a distributed manner.
  arXiv  Detail & Related papers  (2023-06-15T17:42:14Z)
• ARISE: Graph Anomaly Detection on Attributed Networks via Substructure Awareness [70.60721571429784]
  We propose a new graph anomaly detection framework on attributed networks via substructure awareness (ARISE) ARISE focuses on the substructures in the graph to discern abnormalities. Experiments show that ARISE greatly improves detection performance compared to state-of-the-art attributed networks anomaly detection (ANAD) algorithms.
  arXiv  Detail & Related papers  (2022-11-28T12:17:40Z)
• Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning [50.24174211654775]
  We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks. Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair. A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
  arXiv  Detail & Related papers  (2021-02-27T03:17:20Z)
• Structural Causal Models Are (Solvable by) Credal Networks [70.45873402967297]
  Causal inferences can be obtained by standard algorithms for the updating of credal nets. This contribution should be regarded as a systematic approach to represent structural causal models by credal networks. Experiments show that approximate algorithms for credal networks can immediately be used to do causal inference in real-size problems.
  arXiv  Detail & Related papers  (2020-08-02T11:19:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.