<!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 />
    <article-meta>
      <title-group>
        <article-title>A framework for multi-level semantic trace abstraction</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>PhD Candidate Department of Computer Science, University of Torino Corso Svizzera 185</institution>
          ,
          <addr-line>10149 Torino</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <fpage>179</fpage>
      <lpage>183</lpage>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Many commercial information systems and enterprise resource planning tools
routinely adopted by organizations and companies worldwide, like those provided
by, e.g., Oracle and SAP, record information about the executed business process
instances in the form of an event log [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The event log stores the sequences (traces
henceforth [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]) of actions that have been executed at the organization, typically
together with key execution parameters, such as times, costs and resources.
      </p>
      <p>
        Event logs constitute a very rich source of information for several business
process management tasks. Indeed, the experiential knowledge embedded in
traces is directly resorted to, e.g., in operational support and in agile workflow
tools, which can take advantage of trace comparison and retrieval.
Operational support [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] assists users while process instances are being executed, by
making predictions about the instance completion, or recommending suitable
actions, resources or routing decisions, on the basis of the comparison to already
completed instances retrieved from the log. The agile workflow technology [
        <xref ref-type="bibr" rid="ref10 ref8">10,
8</xref>
        ] deals with adaptation and overriding needs in response to expected situations
(e.g., new laws, reengineering e↵orts) as well as to unanticipated exceptions and
problems in the operating environment (e.g., emergencies) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], even if the default
process schema is already in use by some running instances [
        <xref ref-type="bibr" rid="ref2 ref9">9, 2</xref>
        ]: in order to
provide an e↵ective and quick adaptation support, many agile workflow systems
share the idea of recalling and reusing concrete examples of changes adopted in
the past, recorded as traces in the event log. The CBR [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] methodology, and in
particular the retrieval step, can therefore be adopted in this context.
      </p>
      <p>In my PhD thesis, I am developing a framework to compare and retrieve
process traces, represented at di↵erent levels of abstraction . The framework
will then be interfaced to operational support or agile workflow tools, as well
as to other analysis mechanisms. In this paper, I describe the methodological
approach behind trace abstraction; the applications mentioned above will be
considered in my future work.</p>
      <p>Copyright © 2017 for this paper by its authors. Copying permitted for private and
academic purpose. In Proceedings of the ICCBR 2017 Workshops. Trondheim, Norway</p>
    </sec>
    <sec id="sec-2">
      <title>Manuel Striani</title>
      <p>1.1</p>
      <sec id="sec-2-1">
        <title>Multi-level abstraction mechanism</title>
        <p>We are developing a semantic-based, multi-level abstraction mechanism,
able to operate on event log traces. In our approach, actions in the log are
mapped to instances of ground concepts (leaves) in a taxonomy, so that they
can be converted into higher-level concepts by navigating the hierarchy, up to
the desired level, on the basis of the user needs.</p>
        <p>The abstraction mechanism has been designed to properly tackle
nontrivial issues that could emerge. Specifically:
– two actions having the same ancestor in the taxonomy (at the chosen
abstraction level) may be separated in the trace by a delay (i.e., a time interval
where no action takes place), or by actions that descend from a di↵erent
ancestor (interleaved actions henceforth). Our approach allows to deal with
these situations, by creating a single macro-action, i.e., an abstract action
that covers the whole time span of the two actions at hand, and is labeled
as the common ancestor; the macro-action is however built only if the
total delay length, or the total number/length of interleaved actions, do not
overcome proper admissibility thresholds set by the user. The delays and
interleaved actions are quantified and recorded, for possible use in further
analyses. In particular, we have defined a similarity metric where this
information is accounted for as a penalty, and a↵ects the similarity value in
abstract trace comparison;
– abstraction may generate di↵erent types of temporal constraints between
pairs of macro-actions; specifically, given the possible presence of interleaved
actions, we can obtain an abstracted trace with two (or more) overlapping
or concurrent macro-actions. Our approach allows to represent (and exploit)
this information, by properly maintaining both quantitative and qualitative
temporal constraints in abstracted traces. Once again, this temporal
information can be exploited in further analyses. In particular, the similarity
metric we adopt in trace comparison can deal with all types of temporal
constraints.</p>
        <p>Specifically, the procedure to abstract a trace operates as follows:
– for every action i in the trace:
• i is abstracted as its ancestor at the taxonomy level selected by the user;
the macro-action m i, labeled as the identified ancestor, is created;
• for every element j following i in the trace:
⇤ if j is a delay, its length is added to a variable tot delay, that stores
the total delay duration accumulated so far during the creation of
m i;
⇤ if j is an interleaved action, its length is added to a variable tot
inter, that stores the total interleaved actions durations accumulated
so far during the creation of m i;
⇤ if j is an action that, according to domain knowledge, abstracts as
the same ancestor as i, m i is extended to include j, provided that
1. RESEARCH SUMMARY
tot delay and tot inter do not exceed domain-defined thresholds.
j is then removed from the actions in the trace that could start a new
macro-action, since it has already been incorporated into an existing
one;
• the macro-action m i is appended to the output abstracted trace which,
in the end, will contain the list of all the macro-actions that have been
created by the procedure.</p>
        <p>The variables tot delay and tot inter, accumulated during abstraction,
are also provided as an output attribute of each macro-action and they will be
used as a penalty in abstracted trace similarity calculation.</p>
        <p>
          The most significant and original methodological contributions of the work
thus consist in:
1. having defined a proper mechanism for abstracting event log traces,
able to manage non trivial situations (originating from the treatment of
interleaving actions or delays between two actions sharing the same ancestor);
2. having provided a trace comparison facility, which resorts to a
similarity metric (extending the metric presented in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]), able to take into account
also the information recorded during the abstraction phase.
        </p>
        <p>In the third year, I will concentrate on experimental work referring to trace
comparison and I will deal with operational support, agile workflow management,
or other activities, including process mining on abstracted traces. As regards
process mining, in particular, we wish to test when abstraction allows to make
clear and more readable process model.
1.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Current development stage</title>
        <p>
          With the help of an expert physician in stroke patient management, we have
formalized medical domain knowledge in a taxonomy (which has been organized
by goals) by using the Prot`eg`e ontology editor [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. Actions in traces are mapped
to the taxonomy leaves, so navigating the taxonomy it is possibile to abstract
actions by goals. we have worked on a metric for trace comparison that is able
to manage both temporal and non temporal information in traces, and to take
into account information collected during the abstraction process.
        </p>
        <p>The system architecture we have developed, is shown in Figure 1. Rectangles
represent computational modules, while ovals and cylinders represent domain
knowledge sources and the database. The first step to be executed is event log
preparation, that takes in input the available database (DB), and exploits domain
knowledge (the taxonomy); the event log will then undergo abstraction. The
abstracted event log will be given as an input to trace comparison resorting to
the metric we have developed, or to process mining, operational support, or other
activities, that we plan to realize by resorting to ProM.</p>
        <p>Event log
preparation</p>
        <p>Eventlog</p>
        <p>Multi-level
abstraction</p>
        <p>Abstracted
event log</p>
        <p>Trace
comparison
Process mining
Operational support
Agile workflow management</p>
        <p>Taxonomy
During my last PhD year, the framework will be tested in the field of stroke
management, where we will adopt multi-level abstraction and trace comparison
to cluster event logs of di↵erent stroke units, in order to highlight correct and
incorrect behaviors, abstracting from details (such as local resource constraints or
local protocols). The goal will be to show that, the application of the abstraction
mechanism allows to obtain more homogeneous and compact clusters (i.e., able to
aggregate closer examples), still making outliers clearly identifiable, and isolated
in the cluster hierarchy. Some first encouraging results are already available.</p>
        <p>As regards process mining, the ground processes (process learned on trace at
the same level of taxonomy leaves) are typically ”spaghetti-like”: they presents
an extremely large number of nodes and edges which make it hard to identify
details. Our hypothesis is that models learned on abstracted traces will be much
more compact and it will be possible for medical experts to analyze them. This
topic will be studied during my last year as well.</p>
        <p>Finally, we will provide abstracted traces as an input to operational support
or agile workflow management facilities.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Manuel Striani</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>A.</given-names>
            <surname>Aamodt</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Plaza</surname>
          </string-name>
          .
          <article-title>Case-based reasoning: foundational issues, methodological variations and systems approaches</article-title>
          .
          <source>AI Communications</source>
          ,
          <volume>7</volume>
          :
          <fpage>39</fpage>
          -
          <lpage>59</lpage>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>F.</given-names>
            <surname>Casati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ceri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Pernici</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Pozzi</surname>
          </string-name>
          .
          <article-title>Workflow evolutions</article-title>
          .
          <source>Data and Knowledge Engineering</source>
          ,
          <volume>24</volume>
          :
          <fpage>211</fpage>
          -
          <lpage>238</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>W. Van der Aalst. Process</given-names>
            <surname>Mining</surname>
          </string-name>
          . Discovery, Conformance and Enhancement of Business Processes. Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>P.</given-names>
            <surname>Heimann</surname>
          </string-name>
          , G. Joeris,
          <string-name>
            <given-names>C.</given-names>
            <surname>Krapp</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Westfechtel</surname>
          </string-name>
          .
          <article-title>Dynamite: dynamic task nets for software process management</article-title>
          .
          <source>In Proceedings International Conference of Software Engineering</source>
          , pages
          <fpage>331</fpage>
          -
          <lpage>341</lpage>
          , Berlin,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. http : //www.win.tue.nl/ieeetf pm.
          <source>IEEE Taskforce on Process Mining: Process Mining Manifesto (last accessed on</source>
          <volume>4</volume>
          /11/
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>S.</given-names>
            <surname>Montani</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Leonardi</surname>
          </string-name>
          .
          <article-title>Retrieval and clustering for supporting business process adjustment and analysis</article-title>
          .
          <source>Information Systems</source>
          ,
          <volume>40</volume>
          :
          <fpage>128</fpage>
          -
          <lpage>141</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. The Prot´eg´e Team. The Prot´eg´e website: urlhttp://protege.stanford.edu/,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>M.</given-names>
            <surname>Reichert</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Dadam</surname>
          </string-name>
          .
          <article-title>Adeptflex-supporting dynamic changes of workflows without losing control</article-title>
          .
          <source>J. Intell. Inf. Syst.</source>
          ,
          <volume>10</volume>
          :
          <fpage>93</fpage>
          -
          <lpage>129</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>S.</given-names>
            <surname>Rinderle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Reichtert</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Dadam</surname>
          </string-name>
          .
          <article-title>Correctness criteria for dynamic changes in workflow systems - a survey</article-title>
          .
          <source>Data and Knowledge Engineering</source>
          ,
          <volume>50</volume>
          :
          <fpage>9</fpage>
          -
          <lpage>34</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>B.</given-names>
            <surname>Weber</surname>
          </string-name>
          and
          <string-name>
            <given-names>W.</given-names>
            <surname>Wild</surname>
          </string-name>
          .
          <article-title>Towards the agile management of business processes</article-title>
          . In K. D. Altho↵,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dengel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bergmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nick</surname>
          </string-name>
          , and
          <string-name>
            <surname>T.</surname>
          </string-name>
          Roth-Berghofer, editors,
          <source>Professional knowledge management WM</source>
          <year>2005</year>
          , LNCS
          <volume>3782</volume>
          , pages
          <fpage>409</fpage>
          -
          <lpage>419</lpage>
          ,
          <string-name>
            <surname>Washington</surname>
            <given-names>DC</given-names>
          </string-name>
          ,
          <year>2005</year>
          . Springer, Berlin.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>