<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>International Workshop on Process Management in the AI era, August</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Learning execution contexts from event logs (Extended Abstract)⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jing Yang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chun Ouyang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arthur H. M. ter Hofstede</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Centre for Data Science, Queensland University of Technology</institution>
          ,
          <addr-line>2 George St, Brisbane City 4000</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Information Systems, Queensland University of Technology</institution>
          ,
          <addr-line>2 George St, Brisbane City 4000</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>19</volume>
      <issue>2023</issue>
      <fpage>0000</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>Embedding artificial intelligence (AI) capability into business process management systems (BPMS) paves the way for these systems to realize complex process automation, taking into account diferent dynamics in process execution. Human resource behavior is one of the complex factors that contribute to those dynamics. Therefore, it is necessary to be able to have a precise characterization of the multidimensional process execution contexts in which human resources perform, and subsequently how execution contexts are linked with organizational grouping of those resources. In our work [1], we introduce the problem of learning such execution contexts from event logs and propose an approach based on decision tree learning, which utilizes discriminative event information embedded in an event log and domain knowledge about the process. The proposal of this problem and its solution contribute to the accurate understanding of variable human resource behavior in business process execution, and thus toward developing more adaptable and intelligent future BPMS.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;execution contexts</kwd>
        <kwd>organizational model</kwd>
        <kwd>event cube</kwd>
        <kwd>event log</kwd>
        <kwd>multidimensional process mining</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In an era of rapid development of artificial intelligence (AI), there is a growing need for business
process management systems (BPMS) to achieve complex automation that considers dynamic
contexts of process execution [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The variability of human resource behavior is a crucial
contributing factor behind those dynamics, e.g., ad hoc decisions made by workers causing the
usual execution path to diverge.
      </p>
      <p>
        Process mining can be applied to discover employee-related insights from event logs
recording the reality of process execution. Often, resources from the same organizational group
(department, business role, etc.) share similar behavior. For example, resources with the same
role are usually in charge of the same set of process activities, and those who take on the same
time shifts tend to have similar active hours. Execution contexts [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is a notion proposed to
enable a precise characterization of those behavioral similarities of resources.
      </p>
      <p>A set of execution contexts is defined by classifying and combining case types, activity
types, and time types, which represent categories of process instances, activities, and periods,
respectively. The classification of types is mapped onto event attributes in an event log, such
that events can be partitioned according to the execution contexts.</p>
      <p>Figure 1 illustrates the notion of execution contexts, in relation to events in a log and the
organizational grouping of resources as event originators. Consider for example an insurance
company where investigators are organized into diferent customer teams to handle insurance
claims. “(VIP, notify customer, morning)” is one of the execution contexts, where “VIP” is a case
type, “notify customer” is an activity type, and “morning” is a time type. These types are mapped
onto event attributes indicating the type of insurance cover (a case attribute), the premium
amount (another case attribute), the process activity, and the timestamp of activity completion.
As a result, events like “(cover = ‘golden comprehensive’, premium = $15,000, activity name =
‘send notification email’, complete timestamp = 2023/05/16 10:16:58)” will correspond to this
execution context.</p>
      <p>time
types
case
types
activity types</p>
      <p>Silver customer</p>
      <p>team
Gold customer</p>
      <p>team
VIP customer
team
event id case id activity name cover
49336 116 notification email comprehensive $15,000 2023/05/16
send golden
10:16:58
complete
premium timestamp</p>
      <p>investigators
(human resources)
“(VIP, notify customer, morning)”</p>
      <p>
        Modeling such contexts and their connection to organizational groupings is a prerequisite
to accurate understanding of the routines and particularities of human resource behavior in
process execution [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Given a process and its event log, execution contexts can be manually
specified by process analysts [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], who usually possess the relevant domain information or
have clear guiding questions. However, manual specification is not always an option, since the
required domain knowledge cannot be assumed readily available or suficiently concrete [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        To tackle this challenge, we proposed an approach to learning execution contexts from event logs,
which incorporates user-input domain knowledge and discriminative information embedded in
the event data [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The approach is built on a customized decision tree learning algorithm and
is capable of automatically extracting logic rules from an input log, which can then be used to
define high-quality execution contexts.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Approach</title>
      <p>
        We begin with the representation of execution contexts using categorization rules. A
categorization rule (Def. 5 in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]) is a Boolean formula in conjunctive normal form, consisting of one
or more clauses. Each clause can evaluate an event by its value of some type-defining attribute
(Def. 4 in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]). Evaluating a set of categorization rules may dice a collection of events into
sub-collections. Given an event log, a set of categorization rules may be used to define a set
of types on the case, activity, or time dimension, respectively. When combined, three sets of
such categorization rules define a set of execution contexts. For example, the execution context
shown in Figure 1 may be defined by three categorization rules in conjunction:
• Case type “VIP” is defined as cover = ‘golden comprehensive’ ∧ premium &gt;= $12, 000;
• Activity type “notify customer” is defined as activity name ∈ { ‘send notification email’,
‘phone customer’, ‘send notification text message’ }; and
• Time type “morning” is defined as complete timestamp.hour &gt;= 8 ∧ complete
timestamp.hour &lt; 12.
      </p>
      <p>
        Note that many various categorization rules may be constructed, hence resulting in many
candidate sets of execution contexts for any given event log. We propose two measures that
consider the quality of execution contexts based on how well they capture the specialization
among resources. Impurity [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] measures the extent to which the same execution context
contains events originated by diferent resources. Dispersal [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] measures the extent to which
events originated by the same resource disperse across diferent execution contexts. A set of
execution contexts of high quality should have low impurity and low dispersal. That is, (i)
events in the same execution contexts should be originated by few resources, and (ii) events
originated by the same resource should be partitioned into few execution contexts.
      </p>
      <p>The problem of learning execution contexts from an event log is then formalized as the
following. Given an event log, derive three sets of categorization rules that define case types,
activity types, and time types, respectively, such that the resulting execution contexts have low
impurity and low dispersal, i.e., high quality, with respect to the input log.</p>
      <p>
        Our work [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] introduces the first approach to this problem. Given an event log, the approach
begins with deriving an attribute specification to capture user domain knowledge about the
events attributes in the log — it specifies which of the event attributes are relevant to defining
case, activity, and time types; it also records categorization rules supplied by users to capture
any existing categorization of attribute values. Then, guided by the attribute specification, a
customized decision tree learning algorithm is used to iteratively induce categorization rules
from the log, such that each selected split leads to a finer set of execution contexts with the
lowest harmonic mean of dispersal and impurity.
      </p>
      <p>
        We conducted experiments using a real-life event log (BPIC 2015 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]), which demonstrates
the feasibility of our approach and how execution contexts learned from an event log can be
applied for resource-oriented analyses.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ouyang</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. H. M. ter Hofstede</surname>
            ,
            <given-names>W. M. P. van der Aalst</given-names>
          </string-name>
          ,
          <article-title>No Time to Dice: Learning Execution Contexts from Event Logs for Resource-Oriented Process Mining</article-title>
          , in: International Conference on Business Process Management, Springer International Publishing,
          <year>2022</year>
          , pp.
          <fpage>163</fpage>
          -
          <lpage>180</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -16103-2∖_
          <fpage>13</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Fournier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Limonad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Marrella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Montali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Rehse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Accorsi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          , G. De Giacomo,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. La</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Völzer</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Weber</surname>
          </string-name>
          ,
          <article-title>AI-augmented Business Process Management Systems: A Research Manifesto</article-title>
          ,
          <source>ACM Trans. Manage. Inf. Syst</source>
          .
          <volume>14</volume>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          . doi:
          <volume>10</volume>
          .1145/3576047.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ouyang</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. H. M. ter Hofstede</surname>
            ,
            <given-names>Y. Yu,</given-names>
          </string-name>
          <article-title>OrdinoR: A framework for discovering, evaluating, and analyzing organizational models using event logs</article-title>
          ,
          <source>Decis. Support Syst</source>
          .
          <volume>158</volume>
          (
          <year>2022</year>
          )
          <article-title>113771</article-title>
          . doi:
          <volume>10</volume>
          .1016/j.dss.
          <year>2022</year>
          .
          <volume>113771</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>M. L. van Eck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>PM2: A Process Mining Project Methodology</article-title>
          ,
          <source>in: Advanced Information Systems Engineering</source>
          , Springer International Publishing,
          <year>2015</year>
          , pp.
          <fpage>297</fpage>
          -
          <lpage>313</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -19069-3∖_
          <fpage>19</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>B. van Dongen</surname>
          </string-name>
          ,
          <source>BPI Challenge</source>
          <year>2015</year>
          (
          <year>2015</year>
          ). URL: https://data.4tu.nl/collections/ BPI_Challenge_
          <year>2015</year>
          /5065424. doi:
          <volume>10</volume>
          .4121/uuid:
          <fpage>31a308ef</fpage>
          -c844
          <string-name>
            <surname>-</surname>
          </string-name>
          48da-948c305d167a0ec1.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>