<?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">Data-Driven Approaches Towards Transparent Benchmarking of Process Mining Tasks</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Andrea</forename><surname>Maldonado</surname></persName>
							<email>maldonado@dbs.ifi.lmu.de</email>
							<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">Data-Driven Approaches Towards Transparent Benchmarking of Process Mining Tasks</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">B81B063B3CD5519A683E3F4950337991</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T16:33+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>Evaluation</term>
					<term>Event Log Features</term>
					<term>Data Generation</term>
					<term>Process Discovery</term>
					<term>Explainability</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The abundance of new approaches in process mining and the diversity of processes in the real-world, raises the question of this thesis: How can we create benchmarks, which reliably measure the impact of event data features on process mining evaluation? Developing benchmarks, that employ comprehensive intentional ED and also consider connections between ED characteristic features, methods, and metrics, will support process miners to evaluate methods more efficiently and reliably.</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>Information systems meticulously record business events, creating extensive event data (ED). Process Mining (PM) aims to enhance operational processes through ED analysis, providing insights into performance, bottlenecks, and improvement opportunities. <ref type="bibr" target="#b0">[1]</ref> Developing suitable benchmarks to compare the performance of different techniques is one of the major identified challenges in PM <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b2">3]</ref>, especially because selecting the most appropriate technique for a specific situation is difficult without a deep understanding of how these techniques function. The lack of standardization and the diversity of benchmark data limit both the reliability of PM approaches and the credibility of benchmark findings <ref type="bibr" target="#b3">[4,</ref><ref type="bibr" target="#b4">5,</ref><ref type="bibr" target="#b5">6,</ref><ref type="bibr" target="#b6">7]</ref>. To raise the validity and quality of process discovery (PD) evaluations, Rehse et. al. <ref type="bibr" target="#b7">[8]</ref> provide a collection of guidelines to avoid PM crimes, which are also often heavily dependent on the scarcity and quality of available ED. This problem leads us to the following research question: How can we create benchmarks, which reliably measure the impact of ED features on PM evaluation?</p><p>In this PhD project, we focus on benchmarking PD, which learns a control-flow model, i.e., process model from ED <ref type="bibr" target="#b8">[9]</ref>. PD's established quality metrics are simplicity, fitness, precision, and generalization. <ref type="bibr" target="#b9">[10]</ref> Nevertheless, the developed methods can be applied to different PM downstream tasks, such as conformance checking or predictive process monitoring, where a collection of clear evaluation metrics is defined within the benchmarking scope. <ref type="bibr" target="#b13">[14,</ref><ref type="bibr" target="#b14">15,</ref><ref type="bibr" target="#b15">16]</ref>, as well as, the connection between data characteristics and method performances <ref type="bibr" target="#b16">[17]</ref>. For generating event log data primary approaches highlight simulation-based, augmentation-based, and deep learning methods. However, these approaches often rely on real event logs, lack interpretability, or have limitations in controlling feature characteristics and targeting multiple objectives simultaneously. Nevertheless, studies so far still lack the explainable analysis of this connection independent of feature value due scarcity of ED. Therefore, this PhD project aims to provide a framework to benchmark PM approaches using comprehensive ED and explainable methods.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Research Roadmap</head><p>This doctoral thesis will provide the framework for transparent benchmarking PD methods following a design science approach for research design. In this section, we present the current state of research and plans for enhancing the methodology.</p><p>PM benchmarking involves testing multiple methods for a PM task systematically and comparatively in terms of evaluation metrics. Evaluation metrics, configurations, and data characteristics need to be set depending on the PM task. In the case of PD as a PM task, methods -e.g. inductive miner -, quality metrics -e.g. fitness, precision, cfc -and configurations for each method offer established dimensions for benchmarking the PD task. Our benchmarking method can be extended to other PM tasks, as e.g. Trace Clustering, where the before-mentioned dimensions are set, and input is ED. Results for any PM approach heavily depend on ED characteristics.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Event Data Features</head><p>Creating explainable benchmarking of process mining (PM) tasks began with the goal of improving our understanding of the behavior within event data (ED). To achieve this, we developed Feature Extraction from Event Data (FEEED) <ref type="bibr" target="#b17">[18]</ref>, an extendable tool designed to extract (meta-)features from ED. FEEED provides a deeper understanding of ED patterns and similarity trends among event logs of the same nature. For example, it characterizes BPIC15f2 as having 832 traces, a ratio of variants per number of traces of 0.99, and a trace length coefficient variation of 0.37, among others. Given the many features obtainable from ED, we categorized them based on multiple levels of granularity (activity, trace, log) and types of quantitative analysis (statistical and entropy-based) <ref type="bibr" target="#b17">[18]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">ED Generator with Intentional Features</head><p>FEEED enables the exploration of feature values for diverse event data (ED) across various process domains, providing insights into current benchmark data. However, effective benchmarking relies on high-quality evaluation data, which often lacks diversity. To address this, we propose Generating Event Data with Intentional features (GEDI) <ref type="bibr" target="#b3">[4]</ref>, a framework that produces ED with specific features and investigates unexplored regions. For instance, the performance of an approach may be high for ED with a high ratio of variants per number of traces (rvpnot) but low for lower values, which may remain unexamined due to limited available data.</p><p>Our framework aims to generate a comprehensive ED benchmark that explores previously unexplored feature combinations. This allows for a broader data pool, enabling methods to capture a wider range of real-world scenarios and improving evaluation quality. Additionally, iGEDI <ref type="bibr" target="#b18">[19]</ref> provides a web application tool for interactively specifying desired feature values for the ED pool.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Elucidation of ED feature and PD approaches</head><p>The analysis methods explored enable the generation of event data (ED) with intentional features and provide insights into the characteristics of existing ED, supporting transparent analysis of process discovery (PD) techniques. Additionally, we aim to show how understanding ED characteristics can enhance the explainability of PD benchmarking.</p><p>The connection between event data (ED) features and benchmark results has been noted, yet integrating the impact of various ED characteristics into an explainable analysis of evaluation metrics remains a challenge. Our model-agnostic approach proposes using generated ED with intentional features to benchmark PD approaches and measure feature impacts on quality metrics. Through comprehensive benchmarking, we aim to uncover previously unexplored trade-offs, enhancing our understanding of scalability, accuracy, and complexity in PD.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4.">Validation Method</head><p>ED generation methods will be validated on their ability to reproduce 26 publicly available datasets in terms of similarity. To validate the quality of generated comprehensive ED, we will measure the effectiveness of meeting feature value combinations as targets, and their coverage compared to current available datasets. In addition to that, to analyse findings regarding the connection between ED feature values and (PD) evaluation metrics, we employ statistical correlation tests, such as Pearson and Kendalltau and consult literature reviews and primary sources to validate the correctness of the findings. E.g. having more unique variants to capture challenges the construction of a model that accurately reflects the observed behavior, leading to lower fitness. Nevertheless inductive miner is less affected by this ED characteristic than e.g. ilp miner, since the inductive miner uses filters to reduce the infrequent variants. We also plan to validate the results using a sensitive analysis on multiple feature values combinations, as well as an ablation study concerning explainabilty techniques.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5.">Next steps: Explainability and Additional Data Perspectives</head><p>After proposing identifying ED features and creating an ED generator for fulfilling desired feature values, we plan to extend the approaches to transparently benchmark PD methods. Next, we plan to identify feature importance with explainability techniques, including the case of two or more feature values impacting the same PM evaluation metric in a benchmark. Given the vast amount of features found in the literature and the potentially exponential number of ED from feature value combinations, we aim to tame small samples for suitable ED challenges for benchmarking. This approach can enable us to characterize different levels and kinds of difficulty in benchmark ED for each metric. Additionally, we aim to include the human in the loop by involving experts to tailor benchmarks to community needs. Finally, we plan on extending our data-driven framework to the OCEL <ref type="bibr" target="#b19">[20]</ref> and additional data elements perspectives beyond control-flow, acknowledging emerging additional process data.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Conclusion</head><p>In this doctoral thesis, we want to enable process analysts and domain experts to evaluate the suitability of PM methods accounting for significant ED features and understand their connection to the performance of diverse PM approaches. To achieve that, we propose a framework to enhance transparent benchmarking with comprehensive data and explainability. These can help to confirm expected behavior but also allow for deriving novel insights about PM solutions and ED characteristics. The results are validated based on real-world data and domain expertise using quantitative evaluation.</p><p>As limitations, in our first empirical study we could observe that feature selection is crucial for the framework's robustness, leading to strengths and weaknesses. Arbitrary selection can hinder convergence and lead to unfeasible solutions. Furthermore, effective benchmarking requires aligning ED challenges with the task and identifying metrics and methods, introducing assumptions and bias.</p></div>		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">M P</forename><surname>Van Der Aalst</surname></persName>
		</author>
		<title level="m">Process Mining: Discovery, Conformance and Enhancement of Business Processes</title>
				<meeting>ess Mining: Discovery, Conformance and Enhancement of Business esses<address><addrLine>Berlin Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Ieee task force on process mining</title>
		<author>
			<persName><forename type="first">W</forename><surname>Van Der Aalst</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Vanthienen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Lecture Notes in Business Information Processing</title>
		<imprint>
			<biblScope unit="volume">99</biblScope>
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">The need for a process mining evaluation framework in research and practice: position paper</title>
		<author>
			<persName><forename type="first">A</forename><surname>Rozinat</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">K A</forename><surname>De Medeiros</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">W</forename><surname>Günther</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</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>
	</analytic>
	<monogr>
		<title level="m">BPM 2007 International Workshops</title>
				<meeting><address><addrLine>Brisbane, Australia</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2007-09-24">September 24, 2007. 2008</date>
		</imprint>
	</monogr>
	<note>Revised Selected Papers 5</note>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" 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><forename type="middle">M M</forename><surname>Frey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">M</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>
	</analytic>
	<monogr>
		<title level="m">BPM</title>
				<editor>
			<persName><forename type="first">A</forename><surname>Marrella</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Resinas</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Jans</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Rosemann</surname></persName>
		</editor>
		<meeting><address><addrLine>Switzerland, Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer Nature</publisher>
			<date type="published" when="2024">2024</date>
			<biblScope unit="page" from="221" to="237" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<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="b5">
	<monogr>
		<title level="m" type="main">A purpose-guided log generation framework</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>
		<editor>C. Di Ciccio, R. Dijkman, A. del Río Ortega, S. Rinderle-Ma</editor>
		<imprint>
			<date type="published" when="2022">2022</date>
			<publisher>Springer International Publishing</publisher>
			<biblScope unit="page" from="181" to="198" />
			<pubPlace>Cham</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Exploring the impact of process diversity on business process performance</title>
		<author>
			<persName><forename type="first">C</forename><surname>Schreiber</surname></persName>
		</author>
		<ptr target="org" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the ICPM Doctoral Consortium and Demo Track 2021</title>
		<title level="s">CEUR Workshop Proceedings, CEUR-WS.</title>
		<meeting>the ICPM Doctoral Consortium and Demo Track 2021<address><addrLine>Eindhoven, The Netherlands</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2021-11">November, 2021. 2021</date>
			<biblScope unit="volume">3098</biblScope>
			<biblScope unit="page" from="17" to="18" />
		</imprint>
	</monogr>
	<note>ICPM-D 2021</note>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<author>
			<persName><forename type="first">J.-R</forename><surname>Rehse</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Sander</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">M E</forename><surname>Van Der Werf</surname></persName>
		</author>
		<title level="m">Process miner, are you sure? conducting valid and reliable experiments in process mining</title>
				<meeting>ess miner, are you sure? conducting valid and reliable experiments in process mining</meeting>
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Process discovery from event data: relating models and logs through abstractions</title>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">M P V D</forename><surname>Aalst</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">WIREs Data Mining and Knowledge Discovery</title>
		<imprint>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Foundations of process discovery</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">Process Mining Handbook</title>
				<meeting>ess Mining Handbook</meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Benchmarking graph neural networks</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">P</forename><surname>Dwivedi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">K</forename><surname>Joshi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">T</forename><surname>Luu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Laurent</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Bengio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Bresson</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J. Mach. Learn. Res</title>
		<imprint>
			<biblScope unit="volume">24</biblScope>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">When do neural nets outperform boosted trees on tabular data?</title>
		<author>
			<persName><forename type="first">D</forename><surname>Mcelfresh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Khandagale</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Valverde</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Ramakrishnan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Prasad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Goldblum</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>White</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Advances in Neural Information Processing Systems</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Benchmarking large language models for news summarization</title>
		<author>
			<persName><forename type="first">T</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ladhak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Durmus</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Liang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Mckeown</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">B</forename><surname>Hashimoto</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transactions of the Association for Computational Linguistics</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page" from="39" to="57" />
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">On recommendation of process mining algorithms</title>
		<author>
			<persName><forename type="first">J</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">K</forename><surname>Wong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Ding</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Guo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Wen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">2012 IEEE 19th International Conference on Web Services</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2012">2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<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>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Discovery of workflow patternsa comparison of process discovery algorithms</title>
		<author>
			<persName><forename type="first">K</forename><surname>Andree</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Hoang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Dannenberg</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Weber</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Pufahl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Cooperative Information Systems</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Uncovering the relationship between event log characteristics and process discovery techniques</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">K</forename><surname>Vanden Broucke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Delvaux</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Freitas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Rogova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Vanthienen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Baesens</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">BPM 2013 International Workshops</title>
				<meeting><address><addrLine>Beijing, China</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2013-08-26">August 26, 2013. 2014</date>
			<biblScope unit="page" from="41" to="53" />
		</imprint>
	</monogr>
	<note>Revised Papers 11</note>
</biblStruct>

<biblStruct xml:id="b17">
	<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">M</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">ICPM 2023 Tool Demonstration Track</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<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="b18">
	<analytic>
		<title level="a" type="main">iGEDI: interactive generating event data with intentional features</title>
		<author>
			<persName><forename type="first">A</forename><surname>Maldonado</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Aryasomayajula</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">M M</forename><surname>Frey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Seidl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">ICPM 2024 Tool Demonstration Track</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting><address><addrLine>Kongens Lyngby, Denmark</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2024">October 14-18, 2024. 2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<monogr>
		<title level="m" type="main">Ocel: A standard for object-centric event logs</title>
		<author>
			<persName><forename type="first">A</forename><surname>Ghahfarokhi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Park</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Berti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Aalst</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="169" to="175" />
		</imprint>
	</monogr>
</biblStruct>

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