<?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">Multidimensional Process Model Forecasting (MuDiPMF)</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Yongbo</forename><surname>Yu</surname></persName>
							<email>yongbo.yu@kuleuven.be</email>
							<affiliation key="aff0">
								<orgName type="institution">KU Leuven</orgName>
								<address>
									<addrLine>Naamsestraat 69</addrLine>
									<postCode>3000</postCode>
									<settlement>Leuven</settlement>
									<country key="BE">Belgium</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Multidimensional Process Model Forecasting (MuDiPMF)</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">10DD97CA9250048AA429DEC074B1EEBD</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T16:32+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>Process Model Forecasting</term>
					<term>Time Series Forecasting</term>
					<term>Graph Neural Networks</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Process analytics aims to improve processes based on event logs generated by information systems by, among others, automatically discovering models representing the current system. This discovery, however, is typically based on static models, ignoring its underlying trends and shifts. Recently, the modeling and prediction of the full system have been proposed as process model forecasting (PMF). However, the current SOTA lacks the ability to model intricate control flow constructs while also not incorporating extra information, such as resources tied to the process. Besides, by using univariate models, the underlying relations between the different elements of the system are ignored. This proposal addresses these issues by firstly extending PMF to richer control flow models that are able to capture relationships between activities in workflows. Secondly, the current PMF techniques will be replaced by a multivariate framework based on state-of-the-art deep learning techniques such as graph neural networks, which form a natural fit for graph-based models such as workflow diagrams and capture both temporal, structural, and multiscale patterns. Next, additional perspectives, such as resources, will be added to obtain fully object-centric process model forecasts, which can incorporate any data related to a process through the forecasting of event knowledge graphs. Finally, two industry cases in finance and logistics will be used to validate the findings in a real-life setting.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Positioning and Motivation</head><p>Within the field of Process Mining, Predictive Process Monitoring (PPM) entails forecasting future elements of ongoing process instances or cases, including the most probable next activities, outcomes, and remaining runtime. Notably, the integration of machine learning and deep learning solutions into this domain has been extensively explored in academic literature <ref type="bibr" target="#b0">[1]</ref>. While real-time insights at the individual case level allow process owners to intervene in specific instances, they often lack the capacity to provide end-users with information regarding the future trajectory of the entire process. Consequently, a new paradigm known as Process Model Forecasting (PMF) has emerged <ref type="bibr" target="#b1">[2]</ref>, focusing on predicting future states of the overall process model over a long-term horizon, drawing information from historical event data <ref type="bibr" target="#b2">[3]</ref>. This Multidimensional Process Model Forecasting (MuDiPMF) project aims to develop and validate a set of tailored and integrated multi-dimensional forecasting models using multivariate predictive methods for multi-perspective business process models.</p><p>The current state-of-the-art in PMF involves depicting the evolution of process behavior through time series analysis of individual Directly-Follows relations (DFs), which track the frequency of one activity following another within cases, over a predefined timeframe <ref type="bibr" target="#b2">[3]</ref>. These DFs collectively form a Directly-Follows Graph (DFG), a widely utilized process visualization tool offering a clear representation of the flow of the process. The individual DFs are forecasted using univariate time series forecasting techniques, overlooking correlations between different DFs induced by the underlying relations between process elements within the information system. Additionally, DFGs lack the capability to model more nuanced process constructs, such as parallel behavior, in contrast to more semantically rich process model notations like Petri nets and BPMN models.</p><p>Therefore the first objective of MuDiPMF is to forecast more semantically rich process models. This entails expanding the feature set beyond DFs, such as the constructs utilized in advanced process discovery techniques. Furthermore, multimodal predictive models can be used to forecast various time series of multidimensional feature sets simultaneously, thereby accounting for process related dependencies and correlations. Next to this, MuDiPMF aims to enhance the forecasted process models beyond the control-flow aspect, by incorporating additional dimensions such as resource occupation, execution times, and decision point analyses. This would, among others, allow process owners to perform timed interventions regarding bottlenecks, and optimize resource allocations. Furthermore, in recent years Object-Centric Process Mining (OCPM) has emerged as a new family of approaches tailored to handle event data from processes involving different interconnected objects such as orders, items, and shipments, garnering widespread attention in both academia and industry <ref type="bibr" target="#b3">[4]</ref>. Given the rapid emergence and relevance of these object-centric process models, a third objective of MuDiPMF is to develop a framework extending forecasting capabilities to such process models. In summary, the Multidimensional Process Model Forecasting (MuDiPMF) project will significantly contribute to the current state-of-the-art in Business Process Management and Process Mining by enhancing the recently proposed PMF framework by broadening the feature set to be predicted with additional dimensions, while exploring the application of more suitable multivariate predictive methods. Finally, the project aims to demonstrate the practical utility of the different PMF enhancements using real-life process data from two different domains: financial services and logistics.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Current Solutions and Research Objectives</head><p>Figure <ref type="figure" target="#fig_0">1</ref> illustrates the research gaps and research objectives (ROs). Given the recent inception of the PMF paradigm, the state-of-the-art is currently confined to univariate forecasting of distinct DFs <ref type="bibr" target="#b2">[3]</ref>. More specifically, current solutions rely on auto-regressive time-series forecasting techniques such as ARIMA and GARCH. The forecasted DFs can collectively represent a process model (DFG), but are not sufficient to discover more complex process model structures such as parallelism. In contrast, the literature on automated process discovery is more developed, with numerous approaches proposed over the years to discover, e.g., Petri Nets or BPMN models <ref type="bibr" target="#b4">[5]</ref>. Other examples include Heuristics Miner and its extension Fodina, which utilizes various heuristics and formalisms to automatically discover among others, concurrency, exclusive choices, and loops in a process from event logs <ref type="bibr" target="#b5">[6]</ref>, <ref type="bibr" target="#b6">[7]</ref>. Another approach involves a top-down strategy, exemplified by methods like Inductive Miner, which partitions larger event logs into more manageable segments for analysis <ref type="bibr" target="#b7">[8]</ref>. RO1 discusses expanding PMF towards forecasting shifts in processes expressed by more semantically rich process model representations.</p><p>Next, the growing literature on PPM remains relevant despite its focus on single objectives such as suffix prediction <ref type="bibr" target="#b8">[9]</ref>, or case outcome prediction <ref type="bibr" target="#b9">[10]</ref>. Many of the predictive approaches have assumed deep learning models such as long short-term memory networks and even graph neural networks. Many operate a multivariate, but not a multitarget approach, as envisioned for RO2. Finally, a growing interest in the object-centric perspective of process mining has been evident in recent years <ref type="bibr" target="#b10">[11]</ref>. The representation of these object-centric event logs as an event knowledge graph is especially of interest for this project given the similarity of object-centric process models changing over time according to a temporal graph-based structure of the data <ref type="bibr" target="#b11">[12]</ref>. This will be addressed in RO3.</p><p>From an algorithmic perspective underpinning these applications, various data-driven and deep learning approaches for multivariate time series forecasting have been proposed <ref type="bibr" target="#b12">[13]</ref>. Given the graphbased structure of process models, together with their emergence as powerful predictors in different tasks, Graph Neural Networks (GNNs) are a natural match to learn both temporal and structural properties of process models. Particularly, work incorporating the time dimension into GNNs to investigate both spatial and temporal dependency together could provide PMF with more powerful and flexible predictors capable of taking into account process-specific dependencies. Different approaches for spatial-temporal graph neural networks (STGNNs), such as STGCN <ref type="bibr" target="#b13">[14]</ref> and StemGNN <ref type="bibr" target="#b14">[15]</ref>, have shown potential in domains such as traffic forecasting. Develop advanced multivariate and multiscale forecasting algorithms for semantically rich process models.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Multidimensional Process Model Forecasting (MuDiPMF)</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>WP1.2</head><p>Develop time series data transformation techniques for bottleneck, resource, and decision points.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>WP2.1</head><p>Design and implement a GNN-based multidimensional process model forecasting algorithm.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>WP2.2</head><p>Construct event knowledge graphs of object-centric event logs tailored to process model forecasting.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>WP3.1</head><p>Develop heterogeneous graph-based predictive models to forecast objectcentric process models.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>WP3.2</head><p>Case study in financial services Case study in logistics industry  RO1 aims to extend the feature set of the forecasting techniques beyond DFs by incorporating process representations and dependencies utilized in various widely used process discovery methodologies. For example, we can forecast full dependency graphs, as this would allow us to discover parallel activities or forecast the required metrics for the partition creation used by top-down discovery algorithms. Correspondingly, existing predictive models will be replaced with multivariate models capable of simultaneously forecasting all time series while accounting for cross-dependencies. One promising avenue involves the exploration of multi-scale spatial-temporal graph neural networks.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Planned Research Methodology</head><p>RO2 extends process model forecasting capabilities to incorporate control-flow orthogonal dimensions, including bottlenecks, resource allocation, and decision points. We aim to integrate resource information into the feature set, considering multiple granularity levels from overall resource occupancy to allocations at specific activities. Finally, we will incorporate the attention mechanism in GNNs to extract more reliable and efficient patterns and leverage the multitask learning (MTL) framework to implement a multidimensional PMF algorithm.</p><p>RO3 aims to design and implement a comprehensive object-centric process model forecasting algorithm. To account for the complexity of object-centric event logs, we will develop an appropriate event knowledge graph (EKG) structure on top of which a new process model forecasting algorithm can be built. This would entail the construction of time series features for heterogeneous graph elements within EKGs. Next to it, we aim to explore extra architectures tailored toward heterogeneous graph forecasting. The initial avenue that will be pursued focuses on the use of heterogeneous temporal graph neural networks.</p><p>RO4 aims to extend the impact of the developed techniques within MuDiPMF by deploying them in practical applications across diverse industries, specifically targeting the financial services and logistics sectors. The research group's network will be leveraged to collaborate with two partnering companies. Through these case studies, the objective is to demonstrate how the advancements made can substantially improve the state-of-the-art in Process Model Forecasting (PMF) and highlight their practical effectiveness. By validating our algorithms using real-world problems and data, we do not only aim to emphasize their added value, but refinement and adaptation strategies will be developed to make MuDiPMF algorithms extensible to other application domains.</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: Overview of research gaps and objectives</figDesc><graphic coords="2,117.13,212.70,361.04,175.36" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head></head><label></label><figDesc>Semantically rich process model representations RO2: Extend process model forecasting to other dimensions RO3: Object-centric process model forecasting algorithm Engineer data structures for semantically rich control -flow process model forecasting. WP1.1</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Overview of the work packages</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 2</head><label>2</label><figDesc>Figure2presents a schematic overview of the proposed work plan designed based on<ref type="bibr" target="#b15">[16]</ref>, illustrating the alignment of different work packages (WPs) with the four research objectives (ROs).RO1 aims to extend the feature set of the forecasting techniques beyond DFs by incorporating process representations and dependencies utilized in various widely used process discovery methodologies. For example, we can forecast full dependency graphs, as this would allow us to discover parallel activities or forecast the required metrics for the partition creation used by top-down discovery algorithms. Correspondingly, existing predictive models will be replaced with multivariate models capable of simultaneously forecasting all time series while accounting for cross-dependencies. One promising avenue involves the exploration of multi-scale spatial-temporal graph neural networks.RO2 extends process model forecasting capabilities to incorporate control-flow orthogonal dimensions, including bottlenecks, resource allocation, and decision points. We aim to integrate resource information into the feature set, considering multiple granularity levels from overall resource occupancy to allocations at specific activities. Finally, we will incorporate the attention mechanism in GNNs to extract more reliable and efficient patterns and leverage the multitask learning (MTL) framework to implement a multidimensional PMF algorithm.</figDesc></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>This study was financed by the Research Foundation Flanders under grant number G039923N and Internal Funds KU Leuven under grant number C14/23/031. This Ph.D. thesis is supervised by Prof. dr. Johannes De Smedt and Prof. dr. Jochen De Weerdt.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Predictive monitoring of business processes</title>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">M</forename><surname>Maggi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Di Francescomarino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dumas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Ghidini</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Advanced Information Systems Engineering: 26th International Conference, CAiSE 2014</title>
				<meeting><address><addrLine>Thessaloniki, Greece</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2014">June 16-20, 2014. 2014</date>
			<biblScope unit="page" from="457" to="472" />
		</imprint>
	</monogr>
	<note>Proceedings 26</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Process forecasting: Towards proactive business process management</title>
		<author>
			<persName><forename type="first">R</forename><surname>Poll</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Polyvyanyy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Rosemann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Röglinger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Rupprecht</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Business Process Management: 16th International Conference, BPM 2018</title>
				<meeting><address><addrLine>Sydney, NSW, Australia</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2018">September 9-14, 2018. 2018</date>
			<biblScope unit="page" from="496" to="512" />
		</imprint>
	</monogr>
	<note>Proceedings 16</note>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Process model forecasting and change exploration using time series analysis of event sequence data</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">De</forename><surname>Smedt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Yeshchenko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Polyvyanyy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>De Weerdt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mendling</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Data &amp; Knowledge Engineering</title>
		<imprint>
			<biblScope unit="volume">145</biblScope>
			<biblScope unit="page">102145</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Object-centric process mining: Dealing with divergence and convergence in event data</title>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">M</forename><surname>Van Der Aalst</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Software Engineering and Formal Methods: 17th International Conference, SEFM 2019</title>
				<meeting><address><addrLine>Oslo, Norway</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2019">September 18-20, 2019. 2019</date>
			<biblScope unit="page" from="3" to="25" />
		</imprint>
	</monogr>
	<note>Proceedings 17</note>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Automated discovery of process models from event logs: Review and benchmark</title>
		<author>
			<persName><forename type="first">A</forename><surname>Augusto</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Conforti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dumas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Rosa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">M</forename><surname>Maggi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Marrella</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mecella</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Soo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE transactions on knowledge and data engineering</title>
		<imprint>
			<biblScope unit="volume">31</biblScope>
			<biblScope unit="page" from="686" to="705" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title level="m" type="main">Process mining with the heuristicsminer algorithm</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">J</forename><surname>Weijters</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">M</forename><surname>Van Der Aalst</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">A</forename><surname>De Medeiros</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Fodina: A robust and flexible heuristic process discovery technique</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">K</forename><surname>Vanden Broucke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">De</forename><surname>Weerdt</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">decision support systems</title>
		<imprint>
			<biblScope unit="volume">100</biblScope>
			<biblScope unit="page" from="109" to="118" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Discovering block-structured process models from event logs-a constructive approach</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">J</forename><surname>Leemans</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Fahland</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">M</forename><surname>Van Der Aalst</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Application and Theory of Petri Nets and Concurrency: 34th International Conference, PETRI NETS 2013</title>
				<meeting><address><addrLine>Milan, Italy</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2013">June 24-28, 2013. 2013</date>
			<biblScope unit="page" from="311" to="329" />
		</imprint>
	</monogr>
	<note>Proceedings 34</note>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Learning accurate lstm models of business processes</title>
		<author>
			<persName><forename type="first">M</forename><surname>Camargo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dumas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>González-Rojas</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Business Process Management: 17th International Conference, BPM 2019</title>
				<meeting><address><addrLine>Vienna, Austria</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2019">September 1-6, 2019. 2019</date>
			<biblScope unit="page" from="286" to="302" />
		</imprint>
	</monogr>
	<note>Proceedings 17</note>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Outcome-oriented predictive process monitoring: Review and benchmark</title>
		<author>
			<persName><forename type="first">I</forename><surname>Teinemaa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dumas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">L</forename><surname>Rosa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">M</forename><surname>Maggi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Transactions on Knowledge Discovery from Data (TKDD)</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="page" from="1" to="57" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Object-centric process predictive analytics</title>
		<author>
			<persName><forename type="first">R</forename><surname>Galanti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>De Leoni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Navarin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Marazzi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Expert Systems with Applications</title>
		<imprint>
			<biblScope unit="volume">213</biblScope>
			<biblScope unit="page">119173</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Process mining over multiple behavioral dimensions with event knowledge graphs</title>
		<author>
			<persName><forename type="first">D</forename><surname>Fahland</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Process mining handbook</title>
				<meeting>ess mining handbook</meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="274" to="319" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Time-series forecasting with deep learning: a survey</title>
		<author>
			<persName><forename type="first">B</forename><surname>Lim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Zohren</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Philosophical Transactions of the Royal Society A</title>
		<imprint>
			<biblScope unit="volume">379</biblScope>
			<biblScope unit="page">20200209</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<author>
			<persName><forename type="first">B</forename><surname>Yu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Yin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Zhu</surname></persName>
		</author>
		<idno type="arXiv">arXiv:1709.04875</idno>
		<title level="m">Spatio-temporal graph convolutional networks: A deep learning framework for traffic forecasting</title>
				<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Spectral temporal graph neural network for multivariate time-series forecasting</title>
		<author>
			<persName><forename type="first">D</forename><surname>Cao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Duan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Zhu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Huang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Tong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Bai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Tong</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Advances in neural information processing systems</title>
		<imprint>
			<biblScope unit="volume">33</biblScope>
			<biblScope unit="page" from="17766" to="17778" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><surname>Mendling</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Leopold</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Meyerhenke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Depaire</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2310.18979</idno>
		<title level="m">Methodology of algorithm engineering</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

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