Bookkeeping graphs : computational theory and applications
著者
書誌事項
Bookkeeping graphs : computational theory and applications
（Foundations and trends in accounting / editor-in-chief, Stefan J. Reichelstein, v. 17. issue 2）
Now, c2023
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 97-103)
内容説明・目次
内容説明
Bookkeeping Graphs: Computational Theory and Applications 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.
目次
1. Introduction and Overview
2. Bookkeeping Graphs and MDL
3. Pattern Recognition in Bookkeeping Data
4. Summary and Future Work
Acknowledgments
Appendices
References
「Nielsen BookData」 より
