<?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">Identifying Online Child Sexual Texts in Dark Web through Machine Learning and Deep Learning Algorithms</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Vuong</forename><forename type="middle">M</forename><surname>Ngo</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Information System Management Center</orgName>
								<orgName type="institution">Ho Chi Minh City Open University</orgName>
								<address>
									<addrLine>Ho Chi</addrLine>
									<settlement>Minh City</settlement>
									<country key="VN">Vietnam</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Susan</forename><surname>Mckeever</surname></persName>
							<email>susan.mckeever@tudublin.ie</email>
							<affiliation key="aff1">
								<orgName type="department">School of Computer Science</orgName>
								<orgName type="institution">Technological University Dublin</orgName>
								<address>
									<settlement>Grangegorman, Dublin</settlement>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Christina</forename><surname>Thorpe</surname></persName>
							<email>christina.thorpe@tudublin.ie</email>
							<affiliation key="aff3">
								<orgName type="department">School of Informatics and Cybersecurity</orgName>
								<orgName type="institution">Technological University Dublin</orgName>
								<address>
									<postCode>15</postCode>
									<settlement>Blanchardstown, Dublin</settlement>
									<country key="IE">Ireland</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff2">
								<address>
									<country key="IE">Ireland</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff4">
								<orgName type="department">APWG.EU Technical Summit and Researchers Sync</orgName>
								<address>
									<addrLine>Up 2023, June 21 &amp; 22</addrLine>
									<postCode>2023</postCode>
									<settlement>Dublin</settlement>
									<country key="IE">Ireland</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Identifying Online Child Sexual Texts in Dark Web through Machine Learning and Deep Learning Algorithms</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">AD2731D05A4590B14A45ADE1AF4B43E4</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T18:25+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>Child sexual exploitation material</term>
					<term>CSEM</term>
					<term>CSAM</term>
					<term>text content</term>
					<term>artificial intelligent</term>
					<term>forums</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Predators often use the dark web to discuss and share Child Sexual Abuse Material (CSAM) because the dark web provides a degree of anonymity, making it more difficult for law enforcement to track the criminals involved. In most countries, CSAM is considered as forensic evidence of a crime in progress. Processing, identifying and investigating CSAM is often done manually. This is a time-consuming and emotionally challenging task. In this paper, we propose a novel model based on artificial intelligence algorithms to automatically detect CSA text messages in dark web forums. Our algorithms have achieved impressive results in detecting CSAM in dark web, with a recall rate of 89%, a precision rate of 92.3% and an accuracy rate of 87.6%. Moreover, the algorithms can predict the classification of a post in just 1 microsecond and 0.3 milliseconds on standard laptop capabilities. This makes it possible to integrate our model into social network sites or edge devices to for real-time CSAM detection.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>In general, Child Sexual Abuse Material (CSAM) includes any visual, written or audio material that depicts or describes sexual abuse of children. This can include photographs, videos, stories, chats, comments, drawings or any other media <ref type="foot" target="#foot_0">1</ref> . The production and distribution of CSAM has negative impacts on victims and society. Victims can live with long psychological, emotional, and physical harm <ref type="bibr" target="#b0">[1]</ref>. A high volume of CSAM is created and shared daily on both surface web platforms such as social network sites and dark web forums. It is not viable for human experts to investigate, detect and prevent CSAM manually <ref type="bibr" target="#b1">[2]</ref>. However, automatically detecting and analysing online CSA text can be extremely challenging and time-consuming, due to language complexity, contextual ambiguity, dynamic nature of language and large volume of data. This is particularly the case for CSAM shared on the dark web, where privacy and anonymity are prioritized. Moreover, perpetrators often use code words, slang, or other forms of obfuscation to avoid detection and hide their activities.</p><p>In this context, we propose a CSAM detection intelligence model based on both classical Machine Learning (ML) and Deep Learning (DL) techniques. Our CSAM detection model can be used to monitor and remove CSA texts on online platforms in real-time and with high accuracy, providing better protection for children. We have also created a manually labelled dataset of CSAM and non-CSAM content that can be used to train and test CSAM detection algorithms. In the future, our model will be able to detect perpetrator behaviours, collect forensic evidence, and extract valuable knowledge for child agencies, hotlines, education programs and policy makers.</p><p>The remainder of the paper is organised as follows. In the Section 2 we review the related work. Section 3 presents our system architecture and the machine learning and deep learning algorithms. The evaluation methodology and experimental results for the system are shown in Section 4. Finally, we conclude and give some future directions in Section 5.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related Work</head><p>Research works <ref type="bibr" target="#b2">[3]</ref>, <ref type="bibr" target="#b3">[4]</ref>, <ref type="bibr" target="#b4">[5]</ref>, <ref type="bibr" target="#b5">[6]</ref> and <ref type="bibr" target="#b6">[7]</ref> applied deep convolutional neural network models or deep perceptual hashing algorithms with the goal of removing CSAM from social media sites. With the exception of <ref type="bibr" target="#b2">[3]</ref>, papers <ref type="bibr" target="#b3">[4]</ref>, <ref type="bibr" target="#b4">[5]</ref>, <ref type="bibr" target="#b5">[6]</ref> and <ref type="bibr" target="#b6">[7]</ref> used datasets from third-parties to train and test their models. However, these papers only considered CSA images and not text. Similar to our work, research works <ref type="bibr" target="#b7">[8]</ref>, <ref type="bibr" target="#b8">[9]</ref>, <ref type="bibr" target="#b9">[10]</ref>, <ref type="bibr" target="#b10">[11]</ref> and <ref type="bibr" target="#b11">[12]</ref> applied ML and DL models to process CSA text. In <ref type="bibr" target="#b7">[8]</ref>, Naive Bayes (NB), Support Vector Machine (SVM) and Random Forest (RF) were applied to detect online abusive and bullying comments on Facebook and Twitter. In <ref type="bibr" target="#b8">[9]</ref>, the histogram gradient boosted decision trees were exploited for predatory chat conversation detection. In <ref type="bibr" target="#b9">[10]</ref>, Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) were applied for YouTube comments. In <ref type="bibr" target="#b10">[11]</ref>, deepWalk model and graph embedding representations were used to detect abuse chat logs in French on the SpaceOrigin game. In <ref type="bibr" target="#b11">[12]</ref>, Logistic Regression (LR), XG-Boost and Multi Layer Perceptron (MLP) were exploited to detect sexual predatory chats in social networks. To train and test ML/DL models, the papers <ref type="bibr" target="#b7">[8]</ref> and <ref type="bibr" target="#b10">[11]</ref> created their own datasets and the papers <ref type="bibr" target="#b8">[9]</ref>, <ref type="bibr" target="#b9">[10]</ref> and <ref type="bibr" target="#b11">[12]</ref> used datasets of third-parties. However, these papers considered the clear web not the dark web.</p><p>Dark web data was also processed in <ref type="bibr" target="#b12">[13]</ref>, <ref type="bibr" target="#b13">[14]</ref>, <ref type="bibr" target="#b15">[15]</ref>, <ref type="bibr" target="#b16">[16]</ref> and <ref type="bibr" target="#b17">[17]</ref>. However, the approaches did not automatically detect CSA text on the dark web by using post contents and artificial intelligence. In <ref type="bibr" target="#b12">[13]</ref>, the 450 authorised hidden service sites were manually classified. In <ref type="bibr" target="#b13">[14]</ref>, the authors analysed seven popular dark web sites to monitor the sites by using their metadata, e.g. the number of users, site names and common users in sites. In <ref type="bibr" target="#b15">[15]</ref>, the authors statistically analysed some simple metadata e.g. victim ages and the number of CSAM reports per year. In <ref type="bibr" target="#b16">[16]</ref>, K-Means algorithm was applied to cluster the forum comments into the selected seven labels, i.e. breach, financial, drug, vendor, account, product and other. In <ref type="bibr" target="#b17">[17]</ref>, the authors manually analysed transcripts of 53 anonymous suspects in United Kingdom to understand suspects' interaction behaviors and sexual interests.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">System Architecture and Algorithms</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">System Architecture</head><p>Supervised learning in classical ML and DL is a popular method for text classification based on learning patterns from labelled training samples <ref type="bibr" target="#b18">[18,</ref><ref type="bibr">19]</ref>. Every supervised learning algorithm has its strengths and weaknesses. Therefore, to find a suitable algorithm to classify CSAM post contents, we apply the two most popular classical ML algorithms, NB and SVM, and the two most popular DL algorithms, LSTM and BERT (Bidirectional Encoder Representations from Transformers). More details can be found in Section 3.2.</p><p>Figure <ref type="figure" target="#fig_0">1</ref> shows our system architecture used to design and implement our novel algorithm for CSAM text classification. In that, the Supervised Method component implements NB, SVM, LSM and BERT algorithms. The algorithms tokenizes the post texts and transforms them into vector representation using TF.IDF<ref type="foot" target="#foot_1">2</ref> (in NB and SVM) or embedding layers <ref type="foot" target="#foot_2">3</ref> (in LSTM and BERT).</p><p>The Evaluation component is used to determine the execution times (i.e., training time and prediction time) and the classification performance metrics (i.e., precision, recall and accuracy) of each combination of algorithms. To avoid overfitting, we apply 5-fold cross-validation of our dataset. Then the algorithm uses 4 folds for the training set and the remaining fold for the testing set. This process is repeated until every fold serves as the testing set. The average of the recorded classification measures of five rounds are the classification performance measures for the algorithm. Finally, we analyse experimental results on the data set to recommend the best algorithm for CSAM text classification in the dark web.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Machine Learning and Deep Learning</head><p>NB is a specific type of probabilistic classifier that relies on applying Bayes' theorem with certain simplifying assumptions. NB is widely used in natural language processing, spam filtering, and other applications where it is necessary to classify items into different categories based on probabilistic features. It assumes that the features are strongly independent to simplify computation. We used the Gaussian Naive Bayes algorithm implemented in <ref type="bibr" target="#b20">[20]</ref>, with parameters: 𝑎𝑙𝑝ℎ𝑎= 1 and 𝑓 𝑖𝑡_𝑝𝑟𝑖𝑜𝑟= True. Where, 𝑎𝑙𝑝ℎ𝑎 is the additive smoothing parameter and 𝑓 𝑖𝑡_𝑝𝑟𝑖𝑜𝑟 determines whether to learn class' prior probabilities or not.</p><p>SVM represents patterns as points in space and divides the data points by a clear gap. It constructs a maximum margin separator and can perform a non-linear classification by using the so-called kernel trick. We used the C-support vector classification algorithm implemented in <ref type="bibr" target="#b21">[21]</ref>, with parameters: 𝐶= 1.0, 𝑘𝑒𝑟𝑛𝑒𝑙= 'linear', 𝑑𝑒𝑔𝑟𝑒𝑒= 3 and 𝑔𝑎𝑚𝑚𝑎= 'auto'. Where, 𝐶 is the regularization parameter. 𝑘𝑒𝑟𝑛𝑒𝑙 is the used kernel type. 𝑑𝑒𝑔𝑟𝑒𝑒 is the degree of the polynomial kernel function and 𝑔𝑎𝑚𝑚𝑎 is kernel coefficient.</p><p>LSTM is a special kind of Recurrent Neural Network (RNN). RNN is a type of neural network commonly used to develop natural language processing models. RNN remembers the sequence of the data and exploits data patterns and feedback loops for prediction. LSTM was applied to avoid the long-term dependency problem in regular RNN. We used the Bidirectional-LSTM algorithm implemented in <ref type="bibr" target="#b22">[22]</ref>, with parameters:</p><p>𝐸𝑚𝑏𝑒𝑑𝑑𝑖𝑛𝑔= (1000, 128, input_length=200), 𝐵𝑖𝑑𝑖𝑟𝑒𝑐𝑡𝑖𝑜𝑛𝑎𝑙(LSTM(64)), 𝐷𝑟𝑜𝑝𝑜𝑢𝑡(0.5) and 𝐷𝑒𝑛𝑠𝑒(1, activation='sigmoid')</p><p>BERT is a language model using the transformer encoder architecture to process tokens in text. BERT applies pre-training and fine-tuning. Pre-training is an unsupervised way on a general large corpus of text to create BERT model. Fine-tuning is a supervised training BERT model on a specific downstream task with relatively few labels, because the general linguistic patterns have already been learnt during pre-training. We used BERT algorithm implemented in <ref type="bibr" target="#b23">[23]</ref>, with parameters: 𝐾𝑒𝑟𝑎𝑠𝐿𝑎𝑦𝑒𝑟(bert_en_uncased_preprocess_3, bert_en_uncased_L-12_H-768_A-12_4), 𝐷𝑒𝑛𝑠𝑒(1, activa-tion='sigmoid') and 𝑜𝑝𝑡𝑖𝑚𝑖𝑧𝑒𝑟='adam'.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Training and Testing Datasets</head><p>Our first step is to create a labelled dataset that can be used for training or fine-tuning our classifier. The labelled dataset used for our study was collected and supplied by the company Web-IQ, which provided us with over 352,000 posts from 8 dark web forums in 2022, of which approximately 221,000 were in English.</p><p>Using a dictionary of 12,628 Sexual Abuse Phrases (SAPs) extracted from THORN project <ref type="foot" target="#foot_3">4</ref> and Web-IQ dark web forums <ref type="foot" target="#foot_4">5</ref> , we were able to detect approximately 177,000 English posts with no SAP and approximately 44,000 English posts with at least one SAP. This provides us with a high level grouping of posts, but with refinement required to allow for CSAM posts that does not contain any SAPs, and vice versa. Figures <ref type="figure" target="#fig_2">2 and 3</ref> show the word clouds of single words and two-word-phrases related to sexual abuse, extracted from post contents in dark web forums. The size of each word in the clouds represents its frequency in the forums.</p><p>From the group of 177,000 posts with no SAP, experts randomly selected 2,000 non-CSAM posts and 500 CSAM posts. From the group of 44,000 posts with at least one SAP, experts randomly selected 2,000 CSAM posts and 100 non-CSAM posts. Ultimately, our manually labelled dataset contains 4,600 posts from the dark web, including 2,500 CSAM posts and 2,100 non-CSAM posts.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Experiment and Results</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Experiment Setup and Quality Measures</head><p>The algorithms were implemented using Python 3. For the purpose of measuring the quality of the predicted classes of posts compared to the correct classes, we apply the most commonly used metrics namely accuracy, precision and recall ( <ref type="bibr" target="#b24">[24,</ref><ref type="bibr" target="#b25">25]</ref>). The metrics are derived from four categories in the confusion matrix: True Positive (TP), False Positive (FP), True Negative (TN) and False Negative (FN) as follows:</p><p>• TP: Posts in which the algorithm predicted CSAM and the correct class was also CSAM. • FP: Posts in which the algorithm predicted CSAM, but the correct class was non-CSAM. • TN: Posts in which the algorithm predicted non-CSAM and the correct class was non-CSAM. • FN: Posts in which the algorithm predicted non-CSAM, but the correct class was CSAM.</p><p>Accuracy (ACC) in binary classification is defined as a ratio between the correctly classified samples to the total number of samples: 𝐴𝐶𝐶 = 𝑇 𝑃 +𝑇 𝑁 𝑇 𝑃 +𝐹 𝑃 +𝑇 𝑁 +𝐹 𝑁 . The accuracy puts the same emphasis on all these factors. However, when categorising pairs, there is usually a bias: it is much easier to identify true negatives correctly, due to their large number. So, we also look at the the precision 𝑃 = 𝑇 𝑃 𝑇 𝑃 +𝐹 𝑃 and the recall 𝑅 = 𝑇 𝑃 𝑇 𝑃 +𝐹 𝑁 .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Results</head><p>Using the 5-fold cross-validation methodology, each experimental round includes a training set of 3,680 posts (2,000 CSAM and 1,680 non-CSAM) and a testing set of 920 posts (500 CSAM and 420 non-CSAM). Table <ref type="table" target="#tab_1">1</ref> presents the average training time, average prediction time, average precision, average recall and average accuracy of four algorithm combinations as follows:</p><p>• NB: The training time and prediction time were 0.5 and 0.001 seconds, respectively. The precision was 76.1%, recall was 89% and accuracy was 78.8%. The combination of the NB algorithm has the fastest execution time, taking only about 1 microsecond to detect a post on our laptop's capabilities. The second best performing algorithm is SVM, which takes about 0.3 milliseconds. These fast prediction times make our models well-suited for processing CSA text in real-time on social networks. Additionally, our models can run on edge devices with limited computational resources and power supply.</p><p>In terms of classification precision, the SVM combination performs the best with 92.3%, followed by LSTM and BERT as the second and third-best performers, respectively. Meanwhile, the NB combination has the highest recall rate of 89%, followed by LSTM as the second-best performer. When it comes to accuracy, SVM is the best with 87.6% which is slightly higher than LSTM with 87.1%. The BERT algorithm has long training and prediction times, and it is not suitable for binary classification of CSAM posts in dark web.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion and Future Work</head><p>We proposed and implemented a novel algorithm based on machine learning and natural language processing to automatically detect and classify CSAM text post content in dark web. In the experimental evaluation on the dataset of 4,600 CSAM and non-CSAM posts with 5-fold cross-validation, the combination of NB algorithm performed the best in terms of classification recall and execution time. On the other hand, the SVM combination performed the best in terms of classification precision and accuracy, and was the second-best in execution time. The choice of NB and SVM depends on the specific goals and requirements of the CSAM classification task. NB is maximize the number of true positives which could be useful identifying and removing CSAM posts from online platforms to protect potential victims. On the other hand, SVM is minimize false positives which could be useful for identifying CSAM posts to extract information about potential predators and victims for investigative purposes.</p><p>As part of our future work, functional APIs will be implemented to create a user-friendly web application. Furthermore, we aim to leverage the metadata associated with CSAM posts to identify the characteristics, conversation and behaviours of perpetrators. This information can be valuable in developing more effective models for preventing and addressing CSA text on social media platforms. We also will recognise named entities in CSA text to supply important concepts for ML models <ref type="bibr" target="#b26">[26]</ref>.</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: The system architecture for CSAM classification algorithm</figDesc><graphic coords="2,103.91,84.19,387.45,198.85" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: sexual abuse single words in dark web forums</figDesc><graphic coords="3,305.09,89.86,198.42,107.71" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: sexual abuse two-word-phrases in dark web forums</figDesc><graphic coords="3,305.09,236.31,198.43,107.72" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 1</head><label>1</label><figDesc>Average execution time and binary classification performance of the algorithms</figDesc><table><row><cell>Results</cell><cell>NB</cell><cell cols="2">Algorithms SVM LSTM</cell><cell>BERT</cell></row><row><cell>Training time 1</cell><cell>0.5</cell><cell>1.8</cell><cell>32.5</cell><cell>4,261</cell></row><row><cell cols="2">Prediction time 1 0.001</cell><cell>0.27</cell><cell>1.01</cell><cell>215.3</cell></row><row><cell>True Positive</cell><cell>445</cell><cell>421</cell><cell>428</cell><cell>415</cell></row><row><cell>False Positive</cell><cell>140</cell><cell>35</cell><cell>46</cell><cell>68</cell></row><row><cell>True Negative</cell><cell>280</cell><cell>385</cell><cell>374</cell><cell>352</cell></row><row><cell>False Negative</cell><cell>55</cell><cell>79</cell><cell>72</cell><cell>85</cell></row><row><cell>Precision</cell><cell>76.1%</cell><cell>92.3%</cell><cell>90.2%</cell><cell>86%</cell></row><row><cell>Recall</cell><cell>89%</cell><cell>84.2%</cell><cell>85.5%</cell><cell>83%</cell></row><row><cell>Accuracy</cell><cell>78.8%</cell><cell>87.6%</cell><cell>87.1%</cell><cell>83.4%</cell></row><row><cell>1 second.</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell cols="5">• SVM: The training time and prediction time were</cell></row><row><cell cols="5">1.8 and 0.27 seconds, respectively. The precision</cell></row><row><cell cols="5">was 92.3%, recall was 84.2% and accuracy was</cell></row><row><cell>87.6%.</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell cols="5">• LSTM: The training time and prediction time</cell></row><row><cell cols="5">were 32.5 and 1.01 seconds, respectively. The pre-</cell></row><row><cell cols="5">cision was 90.2%, recall was 85.5% and accuracy</cell></row><row><cell>was 87.1%.</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell cols="5">• BERT: The training time and prediction time 4,261</cell></row><row><cell cols="5">and 215.3 seconds, respectively. The precision</cell></row><row><cell cols="5">was 86%, recall was 83% and accuracy was 83.4%.</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">https://www.inhope.org/EN/articles/child-sexual-abuse-material, https://www.hotline.ie/what-to-report/csam, https://www.rainn. org/news/what-child-sexual-abuse-material-csam</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">https://scikit-learn.org/stable/modules/generated/sklearn.featur e_extraction.text.TfidfVectorizer.html</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_2">https://www.tensorflow.org/api_docs/python/tf/keras/layers/Em bedding</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_3">https://www.thorn.org/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="5" xml:id="foot_4">https://web-iq.com/solutions/osint-on-premises</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>The paper is an extension of the long abstract <ref type="bibr" target="#b27">[27]</ref> being part of the N-Light project which is funded by the Safe Online Initiative of End Violence and the Tech Coalition through the Tech Coalition Safe Online Research Fund (Grant number: 21-EVAC-0008-Technological University Dublin). Dr. Vuong Ngo has conducted the research while serving as a data scientist at TU Dublin.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Investigation, detection and prevention of online child sexual abuse materials: A comprehensive survey</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">M</forename><surname>Ngo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Thorpe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">N</forename><surname>Dang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Mckeever</surname></persName>
		</author>
		<idno type="DOI">10.1109/RIVF55975.2022.10013853</idno>
	</analytic>
	<monogr>
		<title level="m">the 16th IEEE International Conference on Computing and Communication Technologies (RIVF-2022)</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="707" to="713" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Detecting child sexual abuse material: A comprehensive survey</title>
		<author>
			<persName><forename type="first">H</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Ermakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Ververis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Fabian</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.fsidi.2020.301022</idno>
	</analytic>
	<monogr>
		<title level="j">Forensic Science International: Digital Investigation</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="page">301022</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Fidalgo, Attm-cnn: Attention and metric learning based cnn for pornography, age and child sexual abuse (csa) detection in images</title>
		<author>
			<persName><forename type="first">A</forename><surname>Gangwar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>González-Castro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Alegre</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename></persName>
		</author>
		<idno type="DOI">10.1016/j.neucom.2021.02.056</idno>
	</analytic>
	<monogr>
		<title level="j">Neurocomputing</title>
		<imprint>
			<biblScope unit="volume">445</biblScope>
			<biblScope unit="page" from="81" to="104" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Detecting child sexual abuse images: traits of child sexual exploitation hosting and displaying websites</title>
		<author>
			<persName><forename type="first">E</forename><surname>Guerra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">G</forename><surname>Westlake</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.chiabu.2021.105336</idno>
	</analytic>
	<monogr>
		<title level="j">Child Abuse &amp; Neglect</title>
		<imprint>
			<biblScope unit="volume">122</biblScope>
			<biblScope unit="page">105336</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Leveraging deep neural networks to fight child pornography in the age of social media</title>
		<author>
			<persName><forename type="first">P</forename><surname>Vitorino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Avila</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Perez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rocha</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jvcir.2017.12.005</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Visual Communication and Image Representation</title>
		<imprint>
			<biblScope unit="volume">50</biblScope>
			<biblScope unit="page" from="303" to="313" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Seeing without looking: Analysis pipeline for child sexual abuse datasets</title>
		<author>
			<persName><forename type="first">C</forename><surname>Laranjeira</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Macedo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Avila</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Santos</surname></persName>
		</author>
		<idno type="DOI">10.1145/3531146.3534636</idno>
	</analytic>
	<monogr>
		<title level="m">the 2022 ACM Conference on Fairness, Accountability, and Transparency (FAccT&apos;22)</title>
				<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="2189" to="2205" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Learning to break deep perceptual hashing: The use case neuralhash</title>
		<author>
			<persName><forename type="first">L</forename><surname>Struppek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Hintersdorf</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Neider</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Kersting</surname></persName>
		</author>
		<idno type="DOI">10.1145/3531146.3533073</idno>
	</analytic>
	<monogr>
		<title level="m">the 2022 ACM Conference on Fairness, Accountability, and Transparency</title>
				<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="58" to="69" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Cyberbullying detection on social networks using machine learning approaches</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">M</forename><surname>Islam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Uddin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Islam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Akter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sharmin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><forename type="middle">K</forename><surname>Acharjee</surname></persName>
		</author>
		<idno type="DOI">10.1109/CSDE50874.2020.9411601</idno>
	</analytic>
	<monogr>
		<title level="m">the 2020 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="1" to="6" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Detecting sexual predatory chats by perturbed data and balanced ensembles</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">R</forename><surname>Borj</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Raja</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bours</surname></persName>
		</author>
		<idno type="DOI">10.1109/BIOSIG52210.2021.9548303</idno>
	</analytic>
	<monogr>
		<title level="m">the 2021 International Conference of the Biometrics Special Interest Group (BIOSIG)</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="1" to="5" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Abusive language detection from social media comments using conventional machine learning and deep learning approaches</title>
		<author>
			<persName><forename type="first">M</forename><surname>Akhter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Jiangbin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Naqvi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Abdelmajeed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Zia</surname></persName>
		</author>
		<idno type="DOI">10.1007/s00530-021-00784-8</idno>
	</analytic>
	<monogr>
		<title level="j">Multimedia Systems</title>
		<imprint>
			<biblScope unit="page" from="1" to="16" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Graph embeddings for abusive language detection</title>
		<author>
			<persName><forename type="first">N</forename><surname>Cecillon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Labatut</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Dufour</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Linares</surname></persName>
		</author>
		<idno type="DOI">10.1007/s42979-020-00413-7</idno>
	</analytic>
	<monogr>
		<title level="j">SN Computer Science</title>
		<imprint>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="page" from="1" to="15" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Digital forensics supported by machine learning for the detection of online sexual predatory chats</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">H</forename><surname>Ngejane</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Eloff</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">J</forename><surname>Sefara</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">N</forename><surname>Marivate</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.fsidi.2021.301109</idno>
	</analytic>
	<monogr>
		<title level="j">Forensic science international: Digital investigation</title>
		<imprint>
			<biblScope unit="volume">36</biblScope>
			<biblScope unit="page">301109</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<author>
			<persName><forename type="first">G</forename><surname>Owen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Savage</surname></persName>
		</author>
		<title level="m">The tor dark net</title>
				<meeting><address><addrLine>Chatham House</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Blackwidow: Monitoring the dark web for cyber security information</title>
		<author>
			<persName><forename type="first">M</forename><surname>Schäfer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Fuchs</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Strohmeier</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Engel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Liechti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Lenders</surname></persName>
		</author>
		<idno type="DOI">10.23919/CYCON.2019.8756845</idno>
		<idno>doi:10.239</idno>
	</analytic>
	<monogr>
		<title level="m">the 11th International Conference on Cyber Conflict (CyCon)</title>
				<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="volume">900</biblScope>
			<biblScope unit="page" from="1" to="21" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<monogr>
		<title/>
		<idno type="DOI">10.23919/CYCON.2019.8756845</idno>
		<idno>/CYCON.2019.8756845</idno>
		<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Investigating the dynamics of illegal online activity: The power of reporting, dark web, and related legislation</title>
		<author>
			<persName><forename type="first">E</forename><surname>Kokolaki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Daskalaki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Psaroudaki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Christodoulaki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Fragopoulou</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.clsr.2020.105440</idno>
	</analytic>
	<monogr>
		<title level="j">Computer Law &amp; Security Review</title>
		<imprint>
			<biblScope unit="volume">38</biblScope>
			<biblScope unit="page">105440</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">An unsupervised model for identifying and characterizing dark web forums</title>
		<author>
			<persName><forename type="first">S</forename><surname>Nazah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Huda</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Abawajy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">M</forename><surname>Hassan</surname></persName>
		</author>
		<idno type="DOI">10.1109/ACCESS.2021.3103319</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Access</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="page" from="112871" to="112892" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Characteristics and behaviors of anonymous users of dark web platforms suspected of child sexual offenses</title>
		<author>
			<persName><forename type="first">J</forename><surname>Woodhams</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Kloess</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Jose</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">E</forename><surname>Hamilton-Giachritsis</surname></persName>
		</author>
		<idno type="DOI">10.3389/fpsyg.2021.623668</idno>
	</analytic>
	<monogr>
		<title level="j">Frontiers in Psychology</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page">623668</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Machine learning based english sentiment analysis</title>
		<author>
			<persName><forename type="first">T</forename><surname>Tran</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Nguyen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Ngo</surname></persName>
		</author>
		<idno type="DOI">10.48550/arXiv.1905.06643</idno>
		<idno>.1905.06643</idno>
		<ptr target="https://doi.org/10.48550/arXiv" />
	</analytic>
	<monogr>
		<title level="j">Journal of Science and Technology</title>
		<imprint>
			<biblScope unit="volume">52</biblScope>
			<biblScope unit="issue">4D</biblScope>
			<biblScope unit="page" from="142" to="155" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<monogr>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">J</forename><surname>Russell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Norvig</surname></persName>
		</author>
		<title level="m">Artificial Intelligence: A Modern Approach</title>
				<imprint>
			<publisher>Pearson</publisher>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
	<note>4th Edition</note>
</biblStruct>

<biblStruct xml:id="b20">
	<monogr>
		<ptr target="https://scikit-learn.org/stable/modules/generated/sklearn.naive_bayes.MultinomialNB.html#sklearn" />
		<title level="m">Multinomial naive bayes</title>
				<imprint>
			<date type="published" when="2023-04-01">2023. April 01, 2023</date>
		</imprint>
	</monogr>
	<note>Scikit-learn</note>
</biblStruct>

<biblStruct xml:id="b21">
	<monogr>
		<ptr target="https://scikit-learn.org/stable/modules/generated/sklearn.svm.SVC.html" />
		<title level="m">C-support vector classification</title>
				<imprint>
			<date type="published" when="2023-04-01">2023. April 01, 2023</date>
		</imprint>
	</monogr>
	<note>Scikit-learn. 1.2.2</note>
</biblStruct>

<biblStruct xml:id="b22">
	<monogr>
		<author>
			<persName><surname>Keras</surname></persName>
		</author>
		<ptr target="1.1" />
		<title level="m">Long short term memory</title>
				<imprint>
			<date type="published" when="2023-04-01">2023. April 01, 2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<monogr>
		<author>
			<persName><surname>Keras</surname></persName>
		</author>
		<ptr target="https://www.tensorflow.org/text/tutorials/classify_text_with_bert" />
		<title level="m">Text classsification with bert</title>
				<imprint>
			<date type="published" when="2023-02">2023. 2. April 01, 2023</date>
		</imprint>
	</monogr>
	<note>1.1.</note>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">An efficient classification algorithm for traditional textile patterns from different cultures based on structures</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">M</forename><surname>Ngo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">V T</forename><surname>Duong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">B T</forename><surname>Nguyen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">T</forename><surname>Nguyen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Conlan</surname></persName>
		</author>
		<idno type="DOI">10.1145/3465381</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1145/3465381" />
	</analytic>
	<monogr>
		<title level="j">Journal on Computing and Cultural Heritage (JOCCH)</title>
		<imprint>
			<biblScope unit="volume">14</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="1" to="22" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Classification assessment methods</title>
		<author>
			<persName><forename type="first">A</forename><surname>Tharwat</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.aci.2018.08.003</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1016/j.aci.2018.08.003" />
	</analytic>
	<monogr>
		<title level="j">Applied Computing and Informatics</title>
		<imprint>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="168" to="192" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">A semantic search engine for historical handwritten document images</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">M</forename><surname>Ngo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Munnelly</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Orlandi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Crooks</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>O'sullivan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Conlan</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-86324-1_7</idno>
	</analytic>
	<monogr>
		<title level="m">Linking Theory and Practice of Digital Libraries</title>
				<editor>
			<persName><forename type="first">G</forename><surname>Berget</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><forename type="middle">M</forename><surname>Hall</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><surname>Brenn</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Kumpulainen</surname></persName>
		</editor>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2021">2021</date>
			<biblScope unit="volume">12866</biblScope>
			<biblScope unit="page" from="60" to="65" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Determining child sexual abuse posts based on artificial intelligence</title>
		<author>
			<persName><forename type="first">S</forename><surname>Mckeever</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Thorpe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">M</forename><surname>Ngo</surname></persName>
		</author>
		<idno type="DOI">10.21427/S3GQ-3536</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.21427/S3GQ-3536" />
	</analytic>
	<monogr>
		<title level="m">the 2023 International Society for the Prevention of Child Abuse &amp; Neglect Congress (ISPCAN-2023)</title>
				<meeting><address><addrLine>Edinburgh, Scotland, UK</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2023">September 24-27, 2023. 2023</date>
			<biblScope unit="page" from="1" to="4" />
		</imprint>
	</monogr>
</biblStruct>

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