<?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">Discovering Hierarchical Process Models Using ProM</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">R</forename><forename type="middle">P</forename><surname>Jagadeesh</surname></persName>
						</author>
						<author>
							<persName><forename type="first">Chandra</forename><surname>Bose</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Mathematics and Computer Science</orgName>
								<orgName type="institution">University of Technology</orgName>
								<address>
									<settlement>Eindhoven</settlement>
									<country key="NL">The Netherlands</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">Philips Healthcare</orgName>
								<address>
									<addrLine>Veenpluis 5-6</addrLine>
									<settlement>Best</settlement>
									<country key="NL">The Netherlands</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Eric</forename><forename type="middle">H M W</forename><surname>Verbeek</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Mathematics and Computer Science</orgName>
								<orgName type="institution">University of Technology</orgName>
								<address>
									<settlement>Eindhoven</settlement>
									<country key="NL">The Netherlands</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Wil</forename><forename type="middle">M P</forename><surname>Van Der Aalst</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Department of Mathematics and Computer Science</orgName>
								<orgName type="institution">University of Technology</orgName>
								<address>
									<settlement>Eindhoven</settlement>
									<country key="NL">The Netherlands</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Discovering Hierarchical Process Models Using ProM</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">8820678512A1702E2B6454F0CA8460A1</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-25T03:24+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 discovery</term>
					<term>process maps</term>
					<term>hierarchical models</term>
					<term>abstractions</term>
					<term>common execution patterns</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Process models can be seen as "maps" describing the operational processes of organizations. Traditional process discovery algorithms have problems dealing with fine-grained event logs and lessstructured processes. The discovered models (i.e., "maps") are spaghettilike and are difficult to comprehend or even misleading. One of the reasons for this can be attributed to the fact that the discovered models are flat (without any hierarchy). In this paper, we demonstrate the discovery of hierarchical process models using a set of interrelated plugins implemented in ProM. 3 The hierarchy is enabled through the automated discovery of abstractions (of activities) with domain significance.</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>We have applied process mining techniques in over 100 organizations. These practical experiences revealed two problems: (a) processes tend to be less structured than what stakeholders expect, and (b) events logs contain fine-grained events whereas stakeholders would like to view processes at a more coarse-grained level. In <ref type="bibr" target="#b0">[1]</ref>, we showed that common execution patterns (e.g., tandem arrays, maximal repeats etc.) manifested in an event log can be used to create powerful abstractions. These abstractions are used in our two-phase approach to process discovery <ref type="bibr" target="#b1">[2]</ref>. The first phase comprises of pre-processing the event log based on abstractions (bringing the log to the desired level of granularity) and the second phase deals with discovering the process maps while providing a seamless zoom-in/out facility. Figure <ref type="figure">1</ref> highlights the difference between the traditional approach to process discovery and our two-phase approach. Note that the process model (map) discovered using the two-phase approach is much simpler.</p><p>The two-phase approach to process discovery <ref type="bibr" target="#b1">[2]</ref> enables the discovery of hierarchical process models. In this paper, we demonstrate the discovery of hierarchical process models using a chain of plugins implemented in ProM. The chain of plugins and their order of application is illustrated in Figure <ref type="figure">2</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Filtering Filter Plugins</head><p>Event Log s a m b c u d n j e s a m q f h l l h g i k e s a m f g h l h i k q e s a m b c d n u j e s a m f h l g i h l h k q e s a m q f g i h l h k e s a m q f g h l h i k e s a m p c u d n r e s a m b d n c u j e s a m p d n c u r e</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Traditional Approach</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Two-phase Approach</head><p>Abstractions defined over common execution patterns The event log may first be cleansed using some simple filters (e.g., adding artificial start/end events, filtering events of a particular transaction type such as considering only 'complete' events etc.). The Pattern Abstractions plugin is then applied on this filtered log one or several times. The Pattern Abstractions plugin has been implemented as a log visualizer in ProM and caters to the discovery of common execution patterns, the definition of abstractions over them, and the pre-processing of the event log with these abstractions. The transformed log (preprocessed log with abstractions) obtained in iteration i is used as the input for the Pattern Abstractions plugin in iteration i + 1. It is this repetitive application of the Pattern Abstractions plugin that enables the definition of multiple levels of hierarchy (new abstractions can be defined over existing abstractions). During the pre-processing phase, for each defined abstraction, the Pattern Abstractions plugin generates a sub-log that captures the manifestation of execution patterns defined by that abstraction as its process instances. The Fuzzy Miner plugin <ref type="bibr" target="#b2">[3]</ref> is then applied on the transformed log obtained after the last iteration. The Fuzzy Miner plugin in ProM has been enhanced to utilize the availability of sub-logs for the defined abstractions. Process models are discovered for each of the sub-logs and are displayed upon zooming in on its corresponding abstract activity.</p><formula xml:id="formula_0">Transformed Log X b Z j e X q Y Y e X Y Y q e X b Z Z j e X Y Y Y q e X q Y Y Y e X q Y Y Y e X p Z</formula><p>Running Example. We use the workflow of a simple digital photo copier as our running example. The copier supports photocopying, scanning and printing of documents in both color and gray modes. The scanned documents can be sent to the user via email or FTP. Upon receipt of a job, the copier first generates an image of the document and subsequently processes the image to enhance its quality. Depending on whether the job request is for a copy/scan or print, separate procedures are followed to generate an image. For print requests, the document is first interpreted and then a rasterization procedure is followed to form an image. The image is then written on the drum, developed, and fused on to the paper.</p><p>We have modeled this workflow of the copier in CPN tools <ref type="bibr" target="#b3">[4]</ref> and generated event logs by simulation. We use one such event log in this paper. The event log consists of 100 process instances, 76 event classes and 40, 995 events. The event log contains fine-grained events pertaining to different procedures (e.g., image processing, image generation etc.) mentioned above. An analyst may not be interested in such low level details. We demonstrate the discovery of the workflow at various levels of abstractions for this event log. -Compute Pattern Metrics: Various metrics (e.g, overlapping and non-overlapping frequency counts, instance count etc.) to assess the significance of the uncovered patterns are supported. -Filter Patterns: It could be the case that too many patterns are uncovered from the event log. To manage this, features to filter patterns that are less significant are supported. -Form and Select Abstractions: Abstractions are defined over the filtered patterns. Patterns that are closely related are grouped together to form abstractions. The approach for forming abstractions is presented in <ref type="bibr" target="#b0">[1]</ref>. Furthermore, various features to edit/select abstractions such as merging two or more abstractions and deleting activities related to a particular abstraction are supported. Figure <ref type="figure" target="#fig_2">5</ref> depicts a few abstractions defined over loop patterns for the copier event log e.g., half-toning, a procedure for enhancing the image quality, is uncovered as an abstraction. -Transform Log: The event log is pre-processed by replacing activity subsequences corresponding to abstractions. A replaced activity subsequence is captured as a process instance in the sub-log for the corresponding abstract activity.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Pattern Abstractions Plugin</head><p>At any iteration, if n abstractions are selected, the Pattern Abstractions plugin generates a transformed log, and n sub-logs (one for each of the n chosen abstractions). We recommend to process for loop patterns in the initial iterations and maximal repeats in the subsequent iterations. For the example event log, we have performed three iterations. The transformed log after the third iteration has 19 event classes and 1601 events. In the process, we have defined various abstractions such as half-toning, image processing, capture image, etc. The Pattern Abstractions plugin supports additional features such as visualizing patterns and exporting the traces that contain the patterns.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Form Abstractions Select Abstractions</head><note type="other">Transform Log</note></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">(Enhanced) Fuzzy Miner Plugin</head><p>The Fuzzy Miner <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b4">5]</ref> is a process miner that mines an event log for a family of process models using a "map" metaphor. As many maps exist that show the city of Amsterdam at different levels of abstraction, also different maps exist for a process model mined from an event log. In this map metaphor, an object of interest in Amsterdam (like the Rijksmuseum or the Anne Frank House) corresponds to a node in the process model, where streets (like the Kalverstraat or the PC Hooftstraat) correspond to edges in the model. For sake of convenience, we call a single map a fuzzy instance whereas we call a family of maps (like all Amsterdam maps) a fuzzy model.</p><p>Like high-level maps only show major objects of interest and major streets, high-level fuzzy instances also show only major elements (nodes and edges). For this purpose, the Fuzzy Miner computes from the log a significance weight for every element and an additional correlation weight for every edge. The higher these weights are, the more major the element is considered to be. Furthermore, the Fuzzy Miner uses a number of thresholds: Only elements that meet these thresholds are shown. As such, these thresholds correspond to the required level of abstraction: The higher these thresholds are, the higher the level of abstraction is. For sake of completeness we mention here that a fuzzy instance may contain clusters of minor nodes: If some objects of interest on the Amsterdam map are too minor to be shown by themselves on some map, they may be shown as a single (and major) object provided that they are close enough. For this reason, the Fuzzy Miner first attempts to cluster minor nodes into major cluster nodes, and only if that does not work it will remove the minor node from the map. Figure <ref type="figure" target="#fig_3">6</ref> shows an example fuzzy model (left-hand side) and fuzzy instance (right-hand side). Note that both views show a fuzzy instance, but the fuzzy model view allows the user to change the thresholds (by changing the sliders) whereas the fuzzy instance view does not. The significance of a node is displayed as part of its label (for example, the node "Transfer Image" has a significance of 0.253), the significance of an edge is visualized using its wideness (the wider the edge, the more significant it is), and the correlation of an edge is visualized using its color contrast (the darker the edge is, the more correlated its input node and its output node are). The octagonal shaped nodes in the right-hand side view correspond to the cluster nodes (one of the cluster nodes contain 4 activities and the other contains 11 activities). All activities on the left hand side except "Job Complete" are contained in a cluster node on the right. Apparently, the significance weights for these nodes (0.262, 0.253, 0.250, 0.296 and 0.403) were too low to be shown, which indicates that the corresponding threshold was set to at least 0.403. Furthermore, the node "Interpret" (on the right) is highly selfcorrelated, whereas the nodes "Transfer Image" and "Send SMTP" (on the left) are moderately correlated.</p><p>The Fuzzy Miner has been enhanced to utilize the availability of sub-logs obtained from the Pattern Abstractions plugin for the chosen abstractions. Fuzzy models are discovered for each of the sub-logs and are displayed upon zooming in on its corresponding abstract activity. Abstract activities are differentiated from other activities by means of a distinct color (a darker shade of blue, see also Figure <ref type="figure" target="#fig_3">6</ref>).</p><p>Figure <ref type="figure" target="#fig_5">7</ref> depicts the top-level process model of the copier example. This model is generated from the transformed log obtained after the third iteration of Pattern Abstractions plugin. The upper branch of the process model corresponds to the creation of the document image for print requests while the lower branch corresponds to image creation for copy/scan requests. The two branches meet after the image is formed and the image is subjected to some image processing functionality. The document is then printed or sent to the user via email or FTP. The lower level details of image creation, image processing, print image have been abstracted in this model. The Pattern Abstractions plugin enables the discovery of such abstractions with strong domain (functional) significance. Upon zooming in on the Image Processing abstraction, the process model depicted in Figure <ref type="figure">8</ref> is shown. This sub-process in turn contains another abstract activity viz., Half Toning (the level of hierarchy is two). Zooming in on this abstract activity displays the sub-process defining it as depicted in Figure <ref type="figure">8</ref>. Figure <ref type="figure">9</ref> depicts two other abstractions.  In this fashion, using the chain of plugins presented in this paper, one can discover hierarchical process models.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Conclusions</head><p>We demonstrated the discovery of hierarchical process models using a chain of plugins implemented in ProM. The repetitive application of Pattern Abstractions plugin enables the discovery of multiple levels of hierarchy. We can use this approach to create maps that (i) depict desired traits, (ii) eliminate irrelevant details, (iii) reduce complexity, and (iv) improve comprehensibility. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Image Processing</head><note type="other">Half Toning</note></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Fig. 1 :Fig. 2 :</head><label>12</label><figDesc>Fig.1: Traditional approach versus our two-phase approach to process discovery. ProM plugins are used to filter the event log. ProM's Pattern Abstractions plugin and the Fuzzy Miner plugin are used to realize simple and intuitive models.</figDesc><graphic coords="2,324.28,297.90,68.03,84.32" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Fig. 3 :Fig. 4 :</head><label>34</label><figDesc>Fig. 3: Building blocks of the Pattern Abstractions plugin</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Fig. 5 :</head><label>5</label><figDesc>Fig. 5: The generation and selection of abstractions in the Pattern Abstractions plugin.</figDesc><graphic coords="5,136.06,177.91,340.16,185.59" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Fig. 6 :</head><label>6</label><figDesc>Fig. 6: Fuzzy model and instance</figDesc><graphic coords="6,136.69,214.64,224.78,172.91" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Fig. 7 :</head><label>7</label><figDesc>Fig.7: The top level process model of the copier event log. Blue (dark colored) nodes are abstract activities that can be zoomed in. Upon zooming in, the sub-process defining the abstraction is shown.</figDesc><graphic coords="7,134.77,366.95,340.16,50.58" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Fig. 8 :Fig. 9 :</head><label>89</label><figDesc>Fig.8: The sub-process captured for the abstraction 'Image Processing' (in the toplevel model). This sub-process in turn contains another abstraction viz., 'Half Toning'. Upon zooming in on 'Half Toning', the sub-process defining that is shown.</figDesc><graphic coords="8,141.73,297.63,113.39,63.43" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="4,136.06,143.52,340.16,185.59" type="bitmap" /></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_0">ProM is an extensible framework that provides a comprehensive set of tools/plugins for the discovery and analysis of process models from event logs. See http://www.processmining.org for more information and to download ProM.</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Acknowledgments R.P.J.C. Bose and W.M.P. van der Aalst are grateful to Philips Healthcare for funding the research in process mining.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Abstractions in Process Mining: A Taxonomy of Patterns</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">P J C</forename><surname>Bose</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">M P</forename><surname>Van Der Aalst</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Business Process Management</title>
				<editor>
			<persName><forename type="first">U</forename><surname>Dayal</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Eder</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Reijers</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename></persName>
		</editor>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="2009">2009</date>
			<biblScope unit="volume">5701</biblScope>
			<biblScope unit="page" from="159" to="175" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Mining Context-Dependent and Interactive Business Process Maps using Execution Patterns</title>
		<author>
			<persName><forename type="first">J</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">P J C</forename><surname>Bose</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">M P</forename><surname>Van Der Aalst</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">BPM 2010 Workshops</title>
				<editor>
			<persName><forename type="first">M</forename><surname>Zur Muehlen</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J</forename><surname>Su</surname></persName>
		</editor>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="2011">2011</date>
			<biblScope unit="volume">66</biblScope>
			<biblScope unit="page" from="109" to="121" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Fuzzy Mining: Adaptive Process Simplification Based on Multi-perspective Metrics</title>
		<author>
			<persName><forename type="first">C</forename><surname>Günther</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">M P</forename><surname>Van Der Aalst</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Business Process Management (BPM 2007)</title>
				<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="2007">2007</date>
			<biblScope unit="volume">4714</biblScope>
			<biblScope unit="page" from="328" to="343" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">CPN Tools for Editing, Simulating, and Analysing Coloured Petri Nets</title>
		<author>
			<persName><forename type="first">A</forename><surname>Vinter Ratzer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Wells</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">M</forename><surname>Lassen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Laursen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">F</forename><surname>Qvortrup</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">S</forename><surname>Stissing</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Westergaard</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Christensen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Jensen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">24th International Conference on Applications and Theory of Petri Nets (ICATPN)</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2003">2003</date>
			<biblScope unit="volume">2679</biblScope>
			<biblScope unit="page" from="450" to="462" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<title level="m" type="main">Automatic Determination of Graph Simplification Parameter Values for Fuzzy Miner</title>
		<author>
			<persName><forename type="first">J</forename><surname>Xia</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2010">2010</date>
		</imprint>
		<respStmt>
			<orgName>Eindhoven University of Technology</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Master&apos;s thesis</note>
</biblStruct>

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