<?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">iGEDI: interactive Generating Event Data with Intentional Features</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Andrea</forename><surname>Maldonado</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Ludwig-Maximilians-Universität</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">Munich Center for Machine Learning Munich</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Sai</forename><forename type="middle">Anirudh</forename><surname>Aryasomayajula</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Ludwig-Maximilians-Universität</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Christian</forename><forename type="middle">M M</forename><surname>Frey</surname></persName>
							<affiliation key="aff2">
								<orgName type="institution">University of Technology Nuremberg</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Thomas</forename><surname>Seidl</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Ludwig-Maximilians-Universität</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">Munich Center for Machine Learning Munich</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">iGEDI: interactive Generating Event Data with Intentional Features</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">2CD1AE6542BF2BB5D2714375C396FDD6</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>Event Data Generation</term>
					<term>Optimization</term>
					<term>Event Log Features</term>
					<term>Benchmarking</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Process mining solutions aim to improve performance, save resources, and address bottlenecks in organizations. However, success depends on data quality and availability, and existing analyses often lack diverse data for rigorous testing. To overcome this, we propose an interactive web application tool, extending the GEDI Python framework, which creates event datasets that meet specific (meta-)features. It provides diverse benchmark event data by exploring new regions within the feature space, enhancing the range and quality of process mining analyses. This tool improves evaluation quality and helps uncover correlations between meta-features and metrics, ultimately enhancing solution effectiveness.</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>The development of benchmark event data (ED) that employs comprehensive intentional feature characteristics and their connections to metrics supports process miners to evaluate methods more efficiently and reliably. However, the availability of diverse data often presents a challenge, ICPM 2024 Tool Demonstration Track, October 14-18, 2024, Kongens Lyngby, Denmark * Corresponding author. Envelope maldonado@dbs.ifi.lmu.de (A. Maldonado); anirudhsai027@gmail.com (S. A. Aryasomayajula); christian.frey@utn.de (C. M. M. Frey); seidl@dbs.ifi.lmu.de (T. Seidl) Orcid 0009-0009-8978-502X (A. Maldonado); 0000-0003-2458-6651 (C. M. M. Frey); 0000-0002-4861-1412 (T. Seidl) limiting the ability to thoroughly evaluate these novel methods. <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b1">2]</ref> Existing tools, such as PURPLE <ref type="bibr" target="#b2">[3]</ref> and Declare4Py <ref type="bibr" target="#b3">[4]</ref> <ref type="bibr" target="#b4">[5]</ref>, assist in generating event logs based on specific properties, but they are often constrained to basic features like trace length and the number of variants. To address this gap, we introduce an interactive online tool that integrates GEDI (Generating Event Data with Intentional Features) <ref type="bibr" target="#b5">[6]</ref> -a framework that offers a broad range of properties, from statistical measures to entropy-based characteristics.</p><p>Our tool, interactive Generating Event Data with Intentional Features (iGEDI) empowers users to create event data tailored to their specific needs and objectives. By supporting seamless customization and integration, our innovative platform not only enhances the efficiency of testing process mining methods but also enables researchers to explore deeper connections between event data characteristics and evaluation metrics. In academic research, it's crucial to train and evaluate methods on diverse datasets to improve robustness and generalization. <ref type="bibr" target="#b5">[6]</ref> demonstrates that evaluation metrics in process discovery are interrelated when models are trained on real-world benchmarks versus enriched data settings. Our tool also allows testing on synthetic datasets that mimic characteristics of inaccessible test data, such as those restricted by GDPR.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">iGEDI's Main Features</head><p>iGEDI, in fig. <ref type="figure" target="#fig_0">1</ref>, is an interactive web application available both as an online service 1 and as a locally executable program 2 . It allows users to create configuration files to subsequently generate event data based on the framework "Generating Event Data with Intentional Features" (GEDI) <ref type="bibr" target="#b5">[6]</ref>. GEDI employs (meta-)features, which numerically describe event log properties, to generate ED that have specific desired values. Supported event data features are presented in the Feature Extraction From Event Data (FEEED) <ref type="bibr" target="#b6">[7]</ref> framework and include statistics as well as more complex, relationships between ED elements. Specifically, the feature types, that are currently supported by iGEDI concern simple summary statistics, entropies <ref type="bibr" target="#b7">[8]</ref>, and epa-based <ref type="bibr" target="#b8">[9]</ref> about cardinality of traces/variants, trace length, variants, and (start/end) activities. For detailed feature descriptions and default settings for realistic bounds, we refer to our repository <ref type="foot" target="#foot_2">3</ref> .</p><p>Defined feature values are handled as targets in a hyperparameter optimization (HPO) problem. As proposed in <ref type="bibr" target="#b5">[6]</ref>, GEDI embeds the Process Tree and Log Generator (PTLG) proposed by Joucke et al. <ref type="bibr" target="#b1">[2]</ref> and iteratively generates a process to optimize the parameters of PTLG, such that novel EDs' features align with the intended feature values, i.e. targets. The parameters of the embedded generator module are optimized by Bayesian Optimization (BO). Intuitively, BO iteratively selects and evaluates promising parameters, aiming to minimize an objective function. Formally, GEDI's objective function tackles a minimization problem of distances in feature space between an array of desired feature values and an array of generated ED's feature values. Hence, by leveraging GEDI, users can reproduce single event logs based on their desired feature values, or examine a grid of event logs, by regarding a hyperrectangle (grid) of specific feature value combinations.</p><p>Alongside implementing our architecture, iGEDI assists users throughout the specification process, automatically generates configuration files defining the feature space, and enables them to deploy GEDI either locally or as an interactive web application. Using the online web app, the user can directly download the generated event logs.</p><p>Next, we describe iGEDI's two options to create one or multiple event logs at once: log rmcv ense BPIC15f4 0.003 0.604 RTFMP 0.376 0.112 HD 0.517 0.254 Table <ref type="table">1</ref>: feature values for three real ED iGEDI supports manual input as well as input from a file. The supported file formats include event logs with a '.xes' extension or '.csv' files. For the event log, users have the option to select features of interest, and the generated event log will be optimized to closely match the feature values of the event log. For the '.csv' option, the file should contain at least one feature column, according to FEEED's <ref type="bibr" target="#b6">[7]</ref> features, a 'log' column containing the name of the target event log. Therefore, one row represents a desired feature combination. Table <ref type="table">1</ref> shows a possible example for such a '.csv' file. It depicts the feature values for ratio most common variant (rmcv) and epa-based normalized sequence entropy (ense), as in <ref type="bibr" target="#b8">[9]</ref>, of three public available datasets <ref type="foot" target="#foot_3">4</ref> , namely BPIC15f4 <ref type="bibr" target="#b9">[10]</ref>, RTFMP <ref type="bibr" target="#b10">[11]</ref> and HD <ref type="bibr" target="#b11">[12]</ref>. While rmcv compares the frequency of the most common variant to the overall number of traces in an event-log, the intuition behind ense <ref type="bibr" target="#b8">[9]</ref> is to measure the variability/predictability of sequences captured by the event-log, considering their prefixes. A low ense indicates a process, where most cases follow similar paths, and a high value indicates a complex or highly variable process with many different paths.</p><p>Moreover, independently of the input option, the user can choose to generate point targets or a multidimensional grid of targets lying within a finite hyperrectangle:</p><p>Point targets mode (as seen in fig. <ref type="figure" target="#fig_0">1</ref>) aims to reproduce ED directly aiming at specified feature values. In manual mode, the user can define specific target values for each selected feature for one generation experiment. Manual input requires semantic knowledge about selected features to choose values in sensible feature ranges. In contrast, inputting a table ("From CSV" option) and choosing the point target option will generate one event log per row, targeting their respective feature values for listed features. To reproduce ED, listed in table 1 in terms of the two selected features, iGEDI will produce three sets of targets for ED generation: [{rmcv: 0.003, ense: 0.604}, {rmcv: 0.376, ense: 0.112}, {rmcv: 0.517, 0.254}] to reproduce BPIC15f4, RTFMP and HD, respectively. Using this option, we generated ED and measured their euclidean similarity to respective targets, as shown in fig. <ref type="figure" target="#fig_1">2</ref>. For the grid-based targets mode, iGEDI provides two possibilities to define the grid: the combinatorial method and the range method. Selecting the combinatorial option, the user can manually define how many combinations of features and feature values they want to generate ED for. By defining 𝑚 features with 𝑘 values, the user will get 𝑘 𝑚 combinations, where each combination represents an event log to be generated. Otherwise using an input csv table, iGEDI suggests 𝑓 𝑚𝑖𝑛 , 𝑓 𝑚𝑎𝑥 i.a. for each feature 𝑓 to create combinations of those feature values. In that case, e.g., table <ref type="table">1</ref> results in statistical values as {rmcv 𝑚𝑖𝑛 : 0.003, rmcv 𝑚𝑎𝑥 : 0.517, ense 𝑚𝑖𝑛 : 0.112, ense 𝑚𝑎𝑥 : 0.604} and four generation experiments with targets: [{rmcv: 0.003, ense: 0.112}, {rmcv: 0.003, ense: 0.604}, {rmcv: 0.517, ense: 0.112}, {rmcv: 0.517, ense: 0.604}].</p><p>Finally, following the range option and manual input for each feature, the user can define a range [𝑓 𝑚𝑖𝑛 , 𝑓 𝑚𝑎𝑥 ] and a 𝑓 𝑠𝑡𝑒𝑝𝑠𝑖𝑧𝑒 for each feature 𝑓. A step size defines a feature-specific sampling rate resulting in several samples along each feature dimension, which are separately used as target values. For example, if the user creates a grid of chosen features rmcv and ense from 0.0 to 1.0, with step size 0.1, GEDI will run 11 ⋅ 11 = 121 generation experiments, with varying feature combinations within those ranges. If the input is a table as table 1, value-based 𝑓 𝑚𝑖𝑛 and 𝑓 𝑚𝑎𝑥 are suggested based on the table's statistics, e.g., {rmcv 𝑚𝑖𝑛 : 0.003, rmcv 𝑚𝑎𝑥 : 0.517}.</p><p>After specifying desired options and feature values, users can run the experiments in our online application, and download the generated event logs. Alternatively, they can download the respective configuration file to run the generation locally, using the displayed command.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Tool maturity</head><p>The quality of generated logs by GEDI in terms of feasibility, representativeness, and usage for benchmarking process mining tasks has been elaborately evaluated in <ref type="bibr" target="#b5">[6]</ref>. In <ref type="bibr" target="#b5">[6]</ref>, an in-depth analysis of inter-feature relations in a generated grid setting is discussed. Figure <ref type="figure" target="#fig_2">3</ref> depicts the target distance between generated event logs and their respective targets with a scale. It contains 121 combinations of features created by the range option, where both features vary between 0.0 and 1.0 with a step size of 0.1, as in the example presented above. The lighter (darker) the color, the closer (further away) the measured feature values from the generated ED to its respective targets. The combination of rmcv and ense exemplarily shows a bright bottom left side and a dark top corner. By definition, a high value of rmcv indicates that the most common variant is highly frequent in the event log, which results in a high amount of cases following a similar path, represented by a low ense value. In contrast, a high ense value indicates high variability in the event logs paths, which constraints the most common path to a low frequency, resulting in low rmcv values. For this reason combinations of simultaneously high values for both rmcv and ense are unfeasible, as depicted in fig. <ref type="figure" target="#fig_2">3</ref>. Therefore, the target distance of generated features indicates the level of feasibility for that particular feature value combination. Subsequently, further analysis about relations between feature values and metrics for a specific task as, e.g. process discovery, can be performed by benchmarking on highly feasible logs from the generated ED collection. Overall, our tool iGEDI enhances existing log generation tools by offering improved functionality and expanded features. It facilitates understanding the relationship between feature sets and evaluation metrics, aiding in the creation of tailored methods for specific tasks. It also supports model pretraining on diverse datasets, enhancing generalization. For testing, iGEDI can replicate feature-based behavior of real-world data, enabling reproducible benchmarking and exploration of feature-metric relations. However, the framework's effectiveness is sensitive to feature selection, with increased complexity potentially leading to unfeasible solutions during hyperparameter optimization.</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: iGEDI interface</figDesc><graphic coords="2,89.29,84.19,416.69,227.20" 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: Euclidean similarity between generated ED and their respective targets.</figDesc><graphic coords="4,89.29,263.14,208.34,102.32" 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: Target similarity between grid generated ED and their targets.</figDesc><graphic coords="5,297.64,328.10,208.33,164.44" type="bitmap" /></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">https://huggingface.co/spaces/andreamalhera/igedi</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">https://pypi.org/project/gedi/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_2">https://github.com/lmu-dbs/gedi/tree/demo-icpm24</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_3">https://www.tf-pm.org/competitions-awards/bpi-challenge</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Screencast and Website</head><p>iGEDI, as an online service is available at https://huggingface.co/spaces/andreamalhera/gedi . The source code, as well as examples, artifacts generated during the experiments, user guide, and examples are available at https://github.com/lmu-dbs/gedi/tree/demo-icpm24. For a short hands-on experience, we refer to our screencast video available at https://youtu.be/9iQhaYwyQ9E.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">An integrated framework for process discovery algorithm evaluation</title>
		<author>
			<persName><forename type="first">T</forename><surname>Jouck</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Bolt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Depaire</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>De Leoni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">M P</forename><surname>Van Der Aalst</surname></persName>
		</author>
		<idno type="arXiv">arXiv:1806.07222</idno>
		<imprint>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Generating artificial data for empirical analysis of control-flow discovery algorithms</title>
		<author>
			<persName><forename type="first">T</forename><surname>Jouck</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Depaire</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Business &amp; Information Systems Engineering</title>
		<imprint>
			<biblScope unit="volume">61</biblScope>
			<biblScope unit="page" from="695" to="712" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Purple: a purpose-guided log generator</title>
		<author>
			<persName><forename type="first">A</forename><surname>Burattin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Re</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Rossi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Tiezzi</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<title level="m" type="main">Declare4py: A python library for declarative process mining</title>
		<author>
			<persName><forename type="first">I</forename><surname>Donadello</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Riva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Maggi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Shikhizada</surname></persName>
		</author>
		<idno>CEUR-WS.org</idno>
		<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="117" to="121" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Asp-based log generation with purposes in declare4py</title>
		<author>
			<persName><forename type="first">I</forename><surname>Donadello</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">F</forename><surname>Riva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Singh</surname></persName>
		</author>
		<ptr target="CEUR-WS.org" />
	</analytic>
	<monogr>
		<title level="m">Doctoral Consortium and Demo Track 2023 at the International Conference on Process Mining 2023 co-located with the 5th International Conference on Process Mining (ICPM 2023)</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<editor>
			<persName><forename type="first">J</forename><forename type="middle">M E M</forename><surname>Van Der Werf</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Cabanillas</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Leotta</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Genga</surname></persName>
		</editor>
		<meeting><address><addrLine>Rome, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2023-10-27">October 27, 2023. 2023</date>
			<biblScope unit="volume">3648</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title level="m" type="main">GEDI: generating event data with intentional features for benchmarking process mining</title>
		<author>
			<persName><forename type="first">A</forename><surname>Maldonado</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Frey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Tavares</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Rehwald</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Seidl</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2024-06">Sep 01-06 (2024</date>
			<pubPlace>Krakow, Poland</pubPlace>
		</imprint>
	</monogr>
	<note>To be published in BPM 2024</note>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">FEEED: feature extraction from event data</title>
		<author>
			<persName><forename type="first">A</forename><surname>Maldonado</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">Marques</forename><surname>Tavares</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">S</forename><surname>Oyamada</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Ceravolo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Seidl</surname></persName>
		</author>
		<ptr target="CEUR-WS.org" />
	</analytic>
	<monogr>
		<title level="m">Doctoral Consortium and Demo Track 2023 at the International Conference on Process Mining 2023 co-located with the 5th International Conference on Process Mining (ICPM 2023)</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<editor>
			<persName><forename type="first">J</forename><forename type="middle">M E M</forename><surname>Van Der Werf</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Cabanillas</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Leotta</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Genga</surname></persName>
		</editor>
		<meeting><address><addrLine>Rome, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2023-10-27">October 27, 2023. 2023</date>
			<biblScope unit="volume">3648</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Entropy as a measure of log variability</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">O</forename><surname>Back</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Debois</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Slaats</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal on Data Semantics</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="page" from="129" to="156" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">The connection between process complexity of event sequences and models discovered by process mining</title>
		<author>
			<persName><forename type="first">A</forename><surname>Augusto</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mendling</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Vidgof</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Wurm</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Information Sciences</title>
		<imprint>
			<biblScope unit="volume">598</biblScope>
			<biblScope unit="page" from="196" to="215" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<monogr>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">F</forename><surname>Van Dongen</surname></persName>
		</author>
		<ptr target="https://data.4tu.nl/articles/dataset/BPI_Challenge_2015/12689204" />
		<title level="m">Bpi challenge 2015 dataset</title>
				<imprint>
			<date type="published" when="2015">2015</date>
		</imprint>
		<respStmt>
			<orgName>Eindhoven University of Technology</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<monogr>
		<author>
			<persName><forename type="first">C</forename><surname>Boulevard</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Kropf</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Van Der Meer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">De</forename><surname>Laet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rozinat</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">F</forename><surname>Van Dongen</surname></persName>
		</author>
		<ptr target="BusinessProcessIntelligenceChallenge" />
		<title level="m">Bpi challenge 2017 road traffic fee management dataset</title>
				<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><surname>Polato</surname></persName>
		</author>
		<ptr target="https://data.4tu.nl/articles/_/12675977/1" />
		<title level="m">Dataset belonging to the help desk log of an italian company</title>
				<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

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