<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Graph Representational Learning for Internal Audit</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><roleName>Sumit</roleName><surname>Pai</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Deloitte &amp; Touche Assurance &amp; Enterprise Risk Services India Private Limited</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Vivek</forename><surname>Singh</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Deloitte &amp; Touche Assurance &amp; Enterprise Risk Services India Private Limited</orgName>
							</affiliation>
						</author>
						<author>
							<persName><surname>Kumar</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Deloitte &amp; Touche Assurance &amp; Enterprise Risk Services India Private Limited</orgName>
							</affiliation>
						</author>
						<author>
							<persName><surname>Chavali</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Deloitte &amp; Touche Assurance &amp; Enterprise Risk Services India Private Limited</orgName>
							</affiliation>
						</author>
						<author>
							<persName><surname>Pavani</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Deloitte &amp; Touche Assurance &amp; Enterprise Risk Services India Private Limited</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Edward</forename><surname>Bowen</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Deloitte &amp; Touche Assurance &amp; Enterprise Risk Services India Private Limited</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Sunil</forename><surname>Tiyyagura</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Deloitte &amp; Touche Assurance &amp; Enterprise Risk Services India Private Limited</orgName>
							</affiliation>
						</author>
						<author>
							<persName><surname>Reddy</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Deloitte &amp; Touche Assurance &amp; Enterprise Risk Services India Private Limited</orgName>
							</affiliation>
						</author>
						<title level="a" type="main">Graph Representational Learning for Internal Audit</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">6DAF3826207E981CEA9BE7F5F69C67EB</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T19:34+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Internal Audit</term>
					<term>Controls testing</term>
					<term>Knowledge Graphs</term>
					<term>Representation Learning</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>This work aims to improve the quality of Internal Audits (IA) that are a critical part of an organization's governance structure and serves as third line of defense helping provide assurance that the controls and processes have adequate risk mitigation strategies in place. We focus on AI enabled internal audits that could improve the quality, coverage and time needed to perform them and thus improve the effectiveness and efficiency of providing assurance, to help auditors identify potential risks that may go unnoticed through traditional methods. We compare different AI methodologies that can be used in controls testing for various financial and corporate processes. We propose the use of Knowledge Graphs (KGs) and representational learning to leverage the inherent relational nature of the data and to identify potential non-compliance or fraud. The experimental results demonstrate that our proposed method exhibits a significant improvement in F1 score, outperforming standard outlier detection approaches, reducing the number of False Positives (FPs) and in turn the manual review involved.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>we identify relationships between the columns, and model the data as a KG. The KG Schema has five primary nodes in red, as shown in the Fig <ref type="figure" target="#fig_0">1</ref>, each of which are described by their respective attributes in green (e.g. transaction amount for the transaction identifier node). The dataset contains continuous, discrete and textual columns, each of which are incorporated in the graph with appropriate pre-processing steps: Continuous values are binned, textual attributes are cleaned, split into keywords and semantically similar words are connected using Bidirectional Encoder Representations from Transformers (BERT)-based word embeddings. We then use a semi-supervised setup, where a small fraction of transactions (&lt; 1%) are noisy labelled as fraudulent based on a small set of controls and are assigned an edge in the KG.  Graph Representational Learning. We leverage the relational modeling power of graphs and learn representations of nodes and edges by propagating this relational information using Knowledge Graph Embedding (KGEs) models <ref type="bibr" target="#b0">[1]</ref>. The trained model is calibrated on a held-out set which is made up of fraudulent and non-fraudulent transactions. The classification threshold is chosen such that it maximizes the F1 on this set and using this threshold the performance is measured on a test set. Both these sets are carved to be representative of the true data distribution where fraudulent transactions are expected to be have a very small percentage.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Results and Conclusion</head><p>Compared to the other two approaches (IF and AE), as shown in Table <ref type="table" target="#tab_0">1</ref>, we clearly see the benefit of relational modeling with the KGs, as we were able to achieve an F1 score of 0.57 on identifying the fraudulent transactions. We provided an overview of IA and a related use-case highlighting the potential benefits of employing semantic modeling and learning based approaches to enhance controls testing. With continuous monitoring, instances of FPs would reduce, enabling greater confidence across the 3 lines of defense. Future Work While the results of transductive models from <ref type="bibr" target="#b0">[1]</ref> are promising, we need to retrain them from scratch as we get new batches of data due to the presence of unseen symbolic nodes. So we plan to explore inductive models, where we can approximate unseen symbolic nodes during inference thus saving huge computational costs of retraining.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Representative KG Schema. Primary nodes are in red and their attributes in green</figDesc><graphic coords="2,123.12,218.09,183.34,93.01" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 :</head><label>1</label><figDesc>Classification Results for Fraudulent Transactions.</figDesc><table><row><cell cols="3">Model Precision Recall</cell><cell>F1</cell></row><row><cell>IF</cell><cell>0.25</cell><cell>0.45</cell><cell>0.32</cell></row><row><cell>AE</cell><cell>0.32</cell><cell>0.55</cell><cell>0.40</cell></row><row><cell>KGE</cell><cell>0.59</cell><cell cols="2">0.55 0.57</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">AmpliGraph: a Library for Representation Learning on Knowledge Graphs</title>
		<author>
			<persName><forename type="first">L</forename><surname>Costabello</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Pai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">L</forename><surname>Van</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Mcgrath</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Mccarthy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Tabacof</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<title level="m" type="main">Tree-Based Credit Card Fraud Detection Using Isolation Forest, Spectral Residual, And Knowledge Graph</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">L</forename><surname>Tang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">D</forename><surname>Le Pham</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">B</forename><surname>Dinh</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2023">2023</date>
			<publisher>MLODS</publisher>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
