Bookkeeping Graphs: Computational Theory and Applications
Foundations and Trends® in Accounting · 18.04.2023 · 17 (2) · 77-172
DOI: 10.1561/1400000070 ↗Kurz gefasst
Fachartikel in der Zeitschrift Foundations and Trends® in Accounting, online erschienen am 18.04.2023. Verfasst von Pierre Jinghong Liang. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 76 Literaturangaben.
Abstract (Originalsprache)
This monograph first describes the graph or network representation of Double-Entry bookkeeping both in theory and in practice. The representation serves as the intellectual basis for a series of applied computational works on pattern recognition and anomaly detection in corporate journal- entry audit settings. The second part of the monograph reviews the computational theory of pattern recognition and anomaly detection built on the Minimum Description Length (MDL) principle. The main part of the monograph describes how the computational MDL theory is applied to recognize patterns and detect anomalous transactions in graphs representing the journal entries of a large set of transactions extracted from real-world corporate entities' bookkeeping data.
Zitieren
APA
Liang, P. J. (2023). Bookkeeping Graphs: Computational Theory and Applications. Foundations and Trends® in Accounting, 17(2), 77-172. https://doi.org/10.1561/1400000070
Vancouver
Liang PJ. Bookkeeping Graphs: Computational Theory and Applications. Foundations and Trends® in Accounting. 2023;17(2):77-172. doi:10.1561/1400000070
BibTeX
@article{Liang2023,
author = {Liang, Pierre Jinghong},
title = {Bookkeeping Graphs: Computational Theory and Applications},
journal = {Foundations and Trends® in Accounting},
year = {2023},
volume = {17},
number = {2},
pages = {77--172},
doi = {10.1561/1400000070}
}
EUVIMED