<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>IMPresseD: Outcome-Oriented Interactive Multi-Interest Process Pattern Discovery Tool</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mozhgan Vazifehdoostirani</string-name>
          <email>m.vazifehdoostirani@tue.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Laura Genga</string-name>
          <email>l.genga@tue.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Xixi Lu</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Remco Dijkman</string-name>
          <email>r.m.dijkman@tue.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Process Pattern Discovery, Multi-interest Pattern Detection, Outcome-Oriented Process Patterns</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Eindhoven University of Technology</institution>
          ,
          <addr-line>Eindhoven</addr-line>
          ,
          <country country="NL">the Netherlands</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Utrecht University</institution>
          ,
          <addr-line>Utrecht</addr-line>
          ,
          <country country="NL">the Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Process pattern discovery methods (PPDMs) have been developed with the primary goal of identifying patterns of interest to users. Existing PPDM approaches are predominantly unsupervised and tend to focus on a single dimension of interest, such as discovering frequent patterns. We present IMPresseD, an interactive tool for exploring process patterns leveraging a multi-dimensional notion of interest. IMPresseD is designed to identify patterns that align with complex analytical objectives, such as deriving process patterns that afect the process outcome. Incorporating an iterative and interactive approach, this tool collaborates with domain experts to enhance pattern discovery.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Process pattern discovery methods (PPDMs) aim to discover process patterns that are of interest
for the human analyst. The interest of a pattern is usually computed according to one or
more functions. Previous studies highlighted how these techniques often uncovered interesting
behaviors that would otherwise remain hidden in start-to-end process models [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. While
various techniques have been proposed for discovering process patterns from event logs [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ],
most of them concentrate on a single interest dimension. This approach can lead to discovering
numerous uninteresting patterns and missing valuable but infrequent ones [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Recent pattern
mining research emphasizes patterns’ multi-dimensional nature [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], relevant in process analysis
due to the interaction of various factors [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. A few PPDMs introduced a broader notion of interest
by allowing users to define cut-of thresholds for various metrics [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] or using a composite metric
during pattern generation [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, these approaches have limitations in handling
multidimensional pattern interest. Defining appropriate cut-of thresholds for conflicting metrics
is a challenging decision that significantly afects results. Moreover, aggregating multiple
dimensions into one obscures the interplay of diferent dimensions, which is especially critical
in the presence of conflicting metrics. To address these challenges, we proposed a multi-objective
†These authors contributed equally.
CEUR
Workshop
Proceedings
approach for process pattern detection.
      </p>
      <p>
        Beyond the multi-objective challenge, most unsupervised PPDMs encounter pattern explosion
in real-world event logs. Prior research suggests leveraging expert domain knowledge through
an interactive setting, allowing the users to select and extend process patterns manually, can
mitigate this issue [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. However, this approach relies on frequency-based metrics and burdens
users with manual tasks lacking suficient guidance.
      </p>
      <p>In this demo paper, we introduce the implementation of IMPresseD (Interactive Multi-interest
Process Pattern Discovery) tool for multi-interest process pattern discovery. IMPresseD is
designed to identify patterns fulfilling a complex, multi-dimensional notion of interest, thus
supporting complex analytical objectives. In particular, in its current implementation, the
tool discovers patterns afecting the process outcome, taking into account diferent interest
functions to tackle the complex and multi-dimensional nature of the problem. To the best
of our knowledge, most outcome-oriented pattern detection approaches do not support a
multi-dimensional analysis. The main functionalities of the tool are described in the following
section.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Innovation and functionality</title>
      <p>
        IMPresseD, a Python-based tool implementing the framework introduced in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], supports
outcome-driven process pattern discovery through two distinct modes: interactive and fully
automatic. There are variations in the output between the two modes, while both share a
common set of core functionalities: multi-interest function analysis, pattern selection, and
pattern extension.
      </p>
      <p>
        - Multi-interest Function: Unlike prior outcome-oriented studies that mainly emphasized
outcome correlation [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], IMPresseD argues for a broader perspective. First, we incorporate
frequency alongside correlation-based interest. Ignoring the frequency measure may lead
to identifying rare patterns that are often less interesting. In addition, frequent patterns
that are not highly correlated may still be worth exploring.
      </p>
      <p>
        Moreover, it is well-known that potential confounding variables may play an important
role in determining the outcome of a treatment process [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Consider a treatment pattern
 1 that negatively impacts outcomes. If  1 is mainly applied to elderly patients, the age
factor could actually be driving the results. To mitigate the efect of confounding variables,
we consider the distance between cases with or without a specific pattern as the third
interest dimension.
- Pattern selection: In practice, optimizing all objective functions simultaneously is often
unattainable. Hence, our aim is to identify the Pareto Front, comprising patterns that are
not dominated by any others concerning the multiple interest functions. This functionality
empowers users to concentrate their eforts on these non-dominated patterns instead of
exploring less interesting patterns.
- Pattern extension: The tool employs an iterative strategy for pattern construction,
commencing with single-activity patterns and subsequently extending the most promising
ones. This extension involves exploring the existing relationships between the selected
patterns and other activities within the event log.
      </p>
      <sec id="sec-3-1">
        <title>2.1. Interactive mode</title>
        <p>
          In addition to the functionalities mentioned earlier, there is a visualizations and user-interaction
functionality specifically designed for the interactive mode. In this setting, selected patterns
based on the Pareto Front are visualized, and a Python interface is designed to allow users to
interact with the pattern discovery algorithm by selecting their desired pattern for extension
in the next iteration. Figure 1 represents a visualization example provided by the tool for a
healthcare case study in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Moreover, Figure 2 demonstrates the interface designed for users to
select their desired patterns from the Pareto Front. This interface allows users to make informed
decisions, considering the values of each interest function, thus facilitating a more interactive
and intuitive pattern exploration and extension process.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>2.2. Automatic mode</title>
        <p>In the automatic setting, all patterns chosen from the Pareto Front will automatically undergo
extension in the subsequent iteration. In this mode, users specify the maximum number of
iterations and initiate the pattern discovery process by clicking the designated button. This
mode is optimized to uncover all relevant patterns for prediction purposes.</p>
        <p>Note that in the automatic mode, the emphasis is on generating patterns and encoding them
in the event log using frequency-based encoding. These encoded patterns serve as new features
for each case, supporting the construction of outcome prediction models through machine
learning algorithms. Thus, instead of visualizing the patterns, the tool outputs encoded patterns
in training and testing sets and also individually in .json format.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Maturity and availability</title>
      <p>
        The existing version of the tool is accessible online via GitHub1. The tool has been used for
analyzing private healthcare data provided by the Netherlands Cancer Registry (NCR) regarding
the treatment process for patients with metastatic stomach or esophageal cancer. The tool
has been evaluated in a real case study involving healthcare experts for the interactive mode.
Furthermore, the automatic discovery version of the tool has been used for extracting
outcomeoriented process patterns from publicly available datasets, namely BPIC2012, BPIC2011, and
Production. These patterns have been encoded and leveraged for outcome prediction tasks. Our
research demonstrates that utilizing these discovered patterns leads to prediction performance
that is either comparable to or superior to using all potential patterns. Results of the
abovementioned case studies are reported in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>To get a firsthand look at how the tool operates in both interactive and automatic modes, we
1https://github.com/MozhganVD/InteractivePatternDetection
have prepared a video demonstration that can be found online2.</p>
    </sec>
    <sec id="sec-5">
      <title>4. Conclusion and future work</title>
      <p>
        This demo paper presents the implementation of the IMPresseD framework introduced in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
The tool supports the user to 1) interactively discover patterns afecting the process outcome
and 2) discover all outcome-oriented patterns for prediction purposes. In future work, we plan
to implement custom definitions of the interest functions. Furthermore, we intend to test the
tool in other real-world case studies. Additionally, we intend to explore additional extension
operators to discover more complex patterns.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N.</given-names>
            <surname>Tax</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sidorova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Haakma</surname>
          </string-name>
          , W. M. van der Aalst,
          <article-title>Mining local process models</article-title>
          ,
          <source>Journal of Innovation in Digital Ecosystems</source>
          <volume>3</volume>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.</given-names>
            <surname>Tax</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Dalmas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sidorova</surname>
          </string-name>
          , W. M.
          <string-name>
            <surname>van der Aalst</surname>
          </string-name>
          , S. Norre,
          <article-title>Interest-driven discovery of local process models</article-title>
          ,
          <source>Information Systems</source>
          <volume>77</volume>
          (
          <year>2018</year>
          )
          <fpage>105</fpage>
          -
          <lpage>117</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>W.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          <article-title>Wu, Mining high quality patterns using multi-objective evolutionary algorithm</article-title>
          ,
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>34</volume>
          (
          <year>2020</year>
          )
          <fpage>3883</fpage>
          -
          <lpage>3898</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          <article-title>, Multi-dimensional process analysis</article-title>
          ,
          <source>in: Business Process Management: 20th International Conference, BPM 2022</source>
          , Springer,
          <year>2022</year>
          , pp.
          <fpage>27</fpage>
          -
          <lpage>33</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>X.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Andrews</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Suriadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Wynn</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. H.</surname>
          </string-name>
          <article-title>ter</article-title>
          <string-name>
            <surname>Hofstede</surname>
          </string-name>
          , W. M. van der Aalst,
          <article-title>Semi-supervised log pattern detection and exploration using event concurrence and contextual information</article-title>
          , in: OTM Confederated International Conferences”
          <article-title>On the Move to Meaningful Internet Systems”</article-title>
          ,
          <year>2017</year>
          , pp.
          <fpage>154</fpage>
          -
          <lpage>174</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vazifehdoostirani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Genga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Verhoeven</surname>
          </string-name>
          ,
          <string-name>
            <surname>H. van Laarhoven</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Dijkman</surname>
          </string-name>
          ,
          <article-title>Interactive multi-interest process pattern discovery</article-title>
          , in: C. Di
          <string-name>
            <surname>Francescomarino</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Burattin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Janiesch</surname>
          </string-name>
          , S. Sadiq (Eds.),
          <source>Business Process Management</source>
          , Springer Nature Switzerland, Cham,
          <year>2023</year>
          , pp.
          <fpage>303</fpage>
          -
          <lpage>319</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>H.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. La</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Suriadi</surname>
          </string-name>
          ,
          <article-title>Mining business process deviance: a quest for accuracy, in: OTM Confederated International Conferences” On the Move to Meaningful Internet Systems”</article-title>
          ,
          <year>2014</year>
          , pp.
          <fpage>436</fpage>
          -
          <lpage>445</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Terada</surname>
          </string-name>
          , D. duVerle, K. Tsuda,
          <article-title>Significant pattern mining with confounding variables</article-title>
          ,
          <source>in: Pacific-Asia Conference on Knowledge Discovery and Data Mining</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>277</fpage>
          -
          <lpage>289</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>