<?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">Predictive Process Mining for Business Process Management Improvement (Extended Abstract)</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Vincenzo</forename><surname>Pasquadibisceglie</surname></persName>
							<email>vincenzo.pasquadibisceglie@uniba.it</email>
							<affiliation key="aff0">
								<orgName type="institution">University of Bari Aldo Moro</orgName>
								<address>
									<settlement>Bari</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">Consorzio Interuniversitario Nazionale per l&apos;Informatica -CINI</orgName>
								<address>
									<settlement>Bari</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Predictive Process Mining for Business Process Management Improvement (Extended Abstract)</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">C7C95B9F990F7C97D716EAB3F969EE54</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-25T04:00+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>Predictive Process Mining</term>
					<term>Computer Vision</term>
					<term>Process Discovery</term>
					<term>Multi-view learning</term>
					<term>Stream learning</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Predictive Process Mining (PPM) has a strategic role in decision-making and managerial contexts of a company since it allows the prediction in advance of the evolution of process instances (traces). Although various PPM algorithms have been proposed in the recent process mining literature, the emergence of machine learning has brought new solutions that still demand for investigation, in order to set new milestones by combining process mining techniques with (deep) machine learning methods. The main goal of this thesis is to explore the potential of such a combination by proposing different novel methods that take advantage of the integration between process mining and machine learning. This integration is explored by handling volume, variety, variability and/or value dimensions of event data.</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>Today's information systems capable of supporting complex business systems store large amounts of process execution (trace) data. Thanks to the availability of large amount of data, possibly collected from a variety of perspectives views), it is possible experimenting new big data analytics methodologies in systems for the management of business processes, in order to take value from activities and/or resources involved in them. Predictive process monitoring (PPM) is one of the emerging process mining field for achieving uncovering insights into the business process. The main innovation of big data analytics techniques for PPM consists in the use of big data mining solutions for the analysis of large amounts of event data retrieved from business processes. Processing event data poses several of the common challenges of big data <ref type="bibr" target="#b0">[1]</ref>, e.g. extracting value from data (value), as well as managing data heterogeneity (variety), data quantity (volume) and data drift (variability). The aim of this research is to propose deep learning-based PPM approaches that allow us to process large volume of event data of various nature, in order to extract valuable information related to a business process.</p><p>According to these premises, the focus of the thesis is on two PPM tasks, i.e. next activity prediction and outcome prediction, which are addressed in different real-life domains by resorting to deep learning techniques. The specific big data challenges addressed for these tasks include:</p><p>• Dealing with high volume of event data eventually collected logging the executions of a complex process model that may also change over time. • Dealing with variety of event data by handling data collected from multiple views (e.g. activities, resources, control-flow) and fueling PPM approaches that take advantages of possible intra-view and inter-view dependencies. • Achieving new value coupling accuracy of PPM approaches to explainability of the learned models. • Dealing with variability of event data that are produced continuously executing a complex business process that may change over time.</p><p>In this thesis, multi-view learning and computer vision approaches are mainly explored to deal with the event variety. Deep learning are trained to fully take advantage of the event volume. Data stream approaches are investigated to deal with volume of event data that may vary over time. Finally, explainable artificial intelligence methods are explored for achieving value from event data extracting interpretable nuggets of knowledge.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Contribution</head><p>The main contributions of this thesis are guided by the following research questions:</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Q1 Is it possible to apply computer vision techniques in the field of PPM? This question is motivated by the significant advances achieved in computer vision developing predictive approaches taking advantages of deep neural networks trained with high volumes of data.</head><p>The possibility of applying computer vision techniques in the field of PPM is explored, in order to contribute to reply to the to the research question Q1. In the literature of PPM, existing methods commonly adopt a sequential representation of process instances. These methods commonly train recurrent RNN or LSTM neural networks dealing with temporal dependencies between information belonging to the same source (e.g. activity) on consecutive events. In alternative to the sequence representation, we propose various image representations of event data, which allow us to model possible dependencies existing among information extracted from different views and take advantage of filters and convolutions to extract a value from dependencies in this variety of information. In the thesis, we explore the achievements of image representations of event data in both activity prediction <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b2">3]</ref> and outcome prediction <ref type="bibr" target="#b3">[4]</ref> problems. The source code of the designed approaches is available on the GitHub repositories 123 .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Q2 Can the multiple views present within the event data produced by companies improve the predictive performance of PPM techniques? This question is motivated by the significant advances achieved in multi-view-learning to deal with variety of data.</head><p>The multi-view learning paradigm is investigated in deep learning to properly handle the variety of event information also in the sequence representation of traces and contribute to reply to the research question Q2. While existing deep learning-based PPM approaches of the current literature mainly consider mandatory event views related to activities, timestamps and/or resources, they neglect any additional, non-standard information that can improve the predictive power of PPM approaches. We propose an approach that can deal event information collected in any view, taking advantage of both intra-view and inter-view dependencies in next activity prediction <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b5">6]</ref>. The source code is available on the GitHub repository <ref type="foot" target="#foot_3">4</ref> .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Q3 Can we extract real value from event data achieving a trade-off between accuracy and interpretability in PPM?</head><p>This question is motivated by the growing importance of the right to explanations, in order to be able to achieve new value in applications involving the use of machine learning and deep learning techniques.</p><p>The growing interest towards developing deep learning-based PPM approaches has led to the development of different solutions in the recent years. These solutions have gained accuracy in PPM tasks being able to transform raw event data volume into higher representations through consecutive transformations, with each transformation reaching a higher level of abstraction and complexity. However, the representation of their sophisticated internal transformations do not provide interpretable insight into the reason for a particular prediction. Thus, these black-box models merely provide an unexplained result. For this reason and to contribute to the recent research conducted to reply to the research question Q3, neuro-fuzzy networks have been investigated as a means to solve the problem of coupling accuracy to interpretability in outcome prediction <ref type="bibr" target="#b6">[7]</ref>. The source code is available on the GitHub repository <ref type="foot" target="#foot_4">5</ref> .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Q4 Is it possible to apply PPM techniques to improve the quality of the model produced by process discovery phase? This question is motivated by the amazing results achieved separately both in PPM and process discovery. Our aim is the investigation of how we can bridge the gap between these two mainstreams on research in process mining.</head><p>A new research direction, coupling PPM to traditional process discovery techniques is explored <ref type="bibr" target="#b7">[8]</ref>, in order to contribute to reply to the question Q4. Process discovery is one of the main branches of process mining. it aims to discover a process model that accurately describes the underlying process captured within the event data recorded in an event log. In general, process discovery algorithms aim to return models describing the entire event log. However, this strategy may lead to discover complex, incomprehensible process models concealing the correct and/or relevant behavior of the underlying process. However, processing the entire event log is no longer feasible when dealing with large amounts of events. This research direction aims at introduce PPM as an abstraction process to improve the quality of the process models produced from a large volume of event data by a process discovery phase. The source code is available on the GitHub<ref type="foot" target="#foot_5">6</ref> .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Q5 Can we adopt stream mining techniques to deal with data arriving continuously and adapting the discovered process model to changes occurred in event data? This</head><p>question is motivated by the significant advancements achieved in stream data mining to deal with data variability, as well as the increasing interest of the process mining community towards the topic of concept drift in event log processing.</p><p>As a business process model is a complex object that produces continuous event data which may change over time, a stream mining process discovery approach is, finally, explored to track how event data vary over time and change the process model to possibly adapt it to the emergence of new data. Results achieved in this direction <ref type="bibr" target="#b8">[9]</ref> allow us to advance the state-of-the art of research related to the research question Q5. The source code is available on the GitHub repository 7 .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Conclusion</head><p>The approaches described in this thesis address various PPM and Process Discovery tasks by processing event data. They operate according to different approaches that allow us to account for different dimensions of big data (e.g. variety, volume, variability, value) in the process mining field. Although they have allowed us to achieve amazing results in several applications, they pave the way for various future research directions. In particular, concerning the next activity prediction and outcome prediction task, additional directions for further work include the extension of the proposed algorithms to deal with the presence of a condition of activity (or outcome) imbalance in an event log. For example, techniques of training data augmentation (e.g. SMOTE <ref type="bibr" target="#b9">[10]</ref> or ADASYN <ref type="bibr" target="#b10">[11]</ref>) may be explored, in order to achieve the balanced condition in the learning stage.</p><p>Another interesting research direction is that of extending the proposed PPM algorithms in a streaming setting with the training performed continuously as new events (of running or new traces) are recorded. This will require the definition of a streaming framework to update the PPM model as new events are collected and deal with concept drifts happening as new events (e.g. activities unobserved before) appear in the process.</p><p>With regard to the analysis of events arising from a stream, an interesting future development is to monitor how PPM-based abstractions change over time. A streaming version on the PPM-abstraction deserves further investigation as it may be an helpful tool for dealing with concept drifts in event streams that do not follow the Pareto's principle.</p><p>Finally, we believe that machine learning and process mining are disciplines that together can lead to the development of innovative solutions to solve problems in business contexts.</p></div>			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">https://github.com/vinspdb/ImagePPMiner</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">https://github.com/vinspdb/PREMIERE</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_2">https://github.com/vinspdb/ORANGE</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_3">https://github.com/vinspdb/MiDA</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="5" xml:id="foot_4">https://github.com/vinspdb/FOX</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="6" xml:id="foot_5">https://github.com/vinspdb/PROMISE</note>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Seven v&apos;s of big data understanding big data to extract value</title>
		<author>
			<persName><forename type="first">M</forename><surname>Khan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Uddin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Gupta</surname></persName>
		</author>
		<idno type="DOI">10.1109/ASEEZone1.2014.6820689</idno>
		<imprint>
			<date type="published" when="2014">2014</date>
			<biblScope unit="page" from="1" to="5" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Using convolutional neural networks for predictive process analytics</title>
		<author>
			<persName><forename type="first">V</forename><surname>Pasquadibisceglie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Appice</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Castellano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Malerba</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICPM.2019.00028</idno>
		<ptr target="https://doi.org/10.1109/ICPM.2019.00028.doi:10.1109/ICPM.2019.00028" />
	</analytic>
	<monogr>
		<title level="m">International Conference on Process Mining, ICPM 2019</title>
				<meeting><address><addrLine>Aachen, Germany</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2019">June 24-26, 2019. 2019</date>
			<biblScope unit="page" from="129" to="136" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Predictive process mining meets computer vision</title>
		<author>
			<persName><forename type="first">V</forename><surname>Pasquadibisceglie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Appice</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Castellano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Malerba</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-58638-6_11</idno>
		<idno>-5 8 6 3 8 -6 \ _ 1 1</idno>
		<ptr target="10.1007/978-3-030" />
	</analytic>
	<monogr>
		<title level="m">Business Process Management Forum -BPM Forum 2020</title>
		<title level="s">Lecture Notes in Business Information Processing</title>
		<editor>
			<persName><forename type="first">D</forename><surname>Fahland</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Ghidini</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Becker</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Dumas</surname></persName>
		</editor>
		<meeting><address><addrLine>Seville, Spain</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2020">September 13-18, 2020. 2020</date>
			<biblScope unit="volume">392</biblScope>
			<biblScope unit="page" from="176" to="192" />
		</imprint>
	</monogr>
	<note>Proceedings</note>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">ORANGE: outcome-oriented predictive process monitoring based on image encoding and cnns</title>
		<author>
			<persName><forename type="first">V</forename><surname>Pasquadibisceglie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Appice</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Castellano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Malerba</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Modugno</surname></persName>
		</author>
		<idno type="DOI">10.1109/ACCESS.2020.3029323</idno>
		<ptr target="https://doi.org/10.1109/ACCESS.2020.3029323.doi:10.1109/ACCESS.2020.3029323" />
	</analytic>
	<monogr>
		<title level="j">IEEE Access</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="page" from="184073" to="184086" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">A multi-view deep learning approach for predictive business process monitoring</title>
		<author>
			<persName><forename type="first">V</forename><surname>Pasquadibisceglie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Appice</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Castellano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Malerba</surname></persName>
		</author>
		<idno type="DOI">10.1109/TSC.2021.3051771</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Services Computing</title>
		<imprint>
			<biblScope unit="page" from="1" to="1" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Leveraging multi-view deep learning for next activity prediction</title>
		<author>
			<persName><forename type="first">V</forename><surname>Pasquadibisceglie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Appice</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Castellano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Malerba</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-2952/paper_290a.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 1st Italian Forum on Business Process Management co-located with the 19th International Conference of Business Process Management (BPM 2021)</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<editor>
			<persName><forename type="first">A</forename><surname>Marrella</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><forename type="middle">T</forename><surname>Dupré</surname></persName>
		</editor>
		<meeting>the 1st Italian Forum on Business Process Management co-located with the 19th International Conference of Business Process Management (BPM 2021)<address><addrLine>Rome, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2021-09-10">September 10th, 2021. 2952. 2021</date>
			<biblScope unit="page" from="1" to="6" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">FOX: a neuro-fuzzy model for process outcome prediction and explanation</title>
		<author>
			<persName><forename type="first">V</forename><surname>Pasquadibisceglie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Castellano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Appice</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Malerba</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICPM53251.2021.9576678</idno>
		<ptr target="https://doi.org/10.1109/ICPM53251.2021.9576678.doi:10.1109/ICPM53251.2021.9576678" />
	</analytic>
	<monogr>
		<title level="m">3rd International Conference on Process Mining, ICPM 2021</title>
				<editor>
			<persName><forename type="first">C</forename><forename type="middle">D</forename><surname>Ciccio</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><forename type="middle">D</forename><surname>Francescomarino</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">P</forename><surname>Soffer</surname></persName>
		</editor>
		<meeting><address><addrLine>Eindhoven, The Netherlands</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2021-11-04">October 31 -Nov. 4, 2021. 2021</date>
			<biblScope unit="page" from="112" to="119" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Coupling predictive process mining to process discovery</title>
		<author>
			<persName><forename type="first">V</forename><surname>Pasquadibisceglie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Appice</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Castellano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Van Der Aalst</surname></persName>
		</author>
		<author>
			<persName><surname>Promise</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ins.2022.05.052</idno>
		<ptr target="https://" />
	</analytic>
	<monogr>
		<title level="j">Information Sciences</title>
		<imprint>
			<biblScope unit="volume">606</biblScope>
			<biblScope unit="page" from="250" to="271" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<author>
			<persName><forename type="first">V</forename><surname>Pasquadibisceglie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Appice</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Castellano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Fiorentino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Malerba</surname></persName>
		</author>
		<title level="m">Stardust: a novel process mining algorithm to discover evolving models from event streams</title>
				<imprint/>
	</monogr>
	<note>Under review</note>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Smote: Synthetic minority over-sampling technique</title>
		<author>
			<persName><forename type="first">N</forename><surname>Chawla</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Bowyer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Hall</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Kegelmeyer</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J. Artif. Intell. Res. (JAIR)</title>
		<imprint>
			<biblScope unit="volume">16</biblScope>
			<biblScope unit="page" from="321" to="357" />
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Adasyn: Adaptive synthetic sampling approach for imbalanced learning</title>
		<author>
			<persName><forename type="first">Haibo</forename><surname>He</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Yang</forename><surname>Bai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">A</forename><surname>Garcia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Shutao</forename><surname>Li</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)</title>
				<imprint>
			<date type="published" when="2008">2008. 2008</date>
			<biblScope unit="page" from="1322" to="1328" />
		</imprint>
	</monogr>
</biblStruct>

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