<!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>Nirdizati 2.0: New Features and Redesigned Backend</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Williams Rizzi</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>Luca Simonetto</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chiara Di Francescomarino</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chiara Ghidini</string-name>
          <email>ghidinig@fbk.eu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>T~onis Kasekamp</string-name>
          <email>toniskasekamp@gmail.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabrizio Maria Maggi</string-name>
          <email>f.m.maggi@ut.ee</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Fondazione Bruno Kessler</institution>
          ,
          <addr-line>Trento</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Free University of Bozen-Bolzano</institution>
          ,
          <addr-line>Bozen</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Tartu</institution>
          ,
          <addr-line>Tartu</addr-line>
          ,
          <country country="EE">Estonia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Nirdizati is a dedicated tool for Predictive Process Monitoring, a eld of Process Mining that aims at predicting how an ongoing execution of a business process will develop in the future using past process executions recorded in event logs. Nirdizati is a web application supporting users in building, comparing, and analyzing predictive models that can then be used to perform predictions on the future of an ongoing case. By providing a rich set of di erent state-of-the-art approaches, Nirdizati o ers BPM researchers and practitioners a useful and exible instrument for investigating and comparing Predictive Process Monitoring techniques. In this paper, we present a Nirdizati version with a redesigned backend, which improves its modularity and scalability, and with new features, which further enrich its capability to support researchers and practitioners to deal with di erent monitoring tasks.</p>
      </abstract>
      <kwd-group>
        <kwd>Predictive Process Monitoring Process Mining Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Nirdizati [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] is an open-source, web-based Predictive Process Monitoring [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]
tool supporting a wide range of state-of-the-art approaches and providing
researchers and practitioners with a highly exible instrument for the construction,
comparison, analysis, and selection of predictive models. The previous version
of Nirdizati supported di erent feature encodings and a variety of learning
algorithms thus enabling the user to select the best predictive model providing
accurate outcome-based (e.g., whether an ongoing trace will produce a certain
outcome eventually in the future) and numerical (e.g., the remaining time of an
ongoing trace) predictions related to a currently running process execution.
      </p>
      <p>In this demo paper, we introduce a new version of Nirdizati that has
been enhanced with: a completely redesigned backend to allow faster
processing and better usage of resources; new algorithms to build the predictive
models; and new encoding techniques to feed the algorithms with a richer set of
features. The backend redesign has introduced a new cache system in the
preprocessing steps, and a database to store the status of the Nirdizati
components and to track the evolution of the system as a whole. The new
features include: (i) incremental learning algorithms, which are able to update
the predictive models at runtime by leveraging new cases, as soon as they
complete; (ii) time series prediction algorithms, which enable the prediction of
the sequence of future activities; and (iii) intercase feature encoding, for
taking into account not only the current ongoing case when making predictions
on the current case, but also other concurrent ongoing cases. The current
version of the tool is online at http://research.nirdizati.org/, while a
tutorial and a video are available at https://drive.google.com/drive/folders/
1sG69DabBhmuPsWAOPA4yNLjFbEFVknY0.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Redesigned Backend</title>
      <p>By design, Nirdizati4 supports the multiprocessing capabilities of nowadays
processors, using a master-slave setting (see Fig. 1). In this setting, the
master - the server in Fig. 1 - creates and orchestrates the jobs, and the slaves
the workers in Fig. 1 - take care of performing the jobs. When using such a
setting for comparing di erent algorithms on the same task, most of the
processing time is taken for the pre-processing phases that are repeated over and
over for each di erent con guration. To overcome this time and resource
consumption, Nirdizati has now been equipped with a cache system that avoids
pre-processing the data multiple times when evaluating multiple approaches on
a shared task and dataset.</p>
      <p>When using caching in the Nirdizati architecture, however, two or more
slaves performing the same pre-processing step concurrently can generate
duplicate cache les. A database system able to track in a granular way the status of</p>
      <sec id="sec-2-1">
        <title>4 Source code available at https://github.com/nirdizati-research/</title>
        <p>each object of the tool, i.e., the set of elements used in a given task, has been
introduced. For instance, the object representing the task of splitting a log into
a training and a validation set is composed of a foreign key to the object
representing the log, the training and the validation set sizes, the type of ordering
used for the split, the name of the split, and a unique key. Storing each object
of the tool in a table of the database allows, on the one hand, an easy retrieval
of the required information and, on the other hand, keeping in memory only
the database keys instead of the objects themselves, resulting in a lighter
footprint on the memory. From the database it is possible to retrieve the current jobs
and their status, the available cached information, the previously trained models
and the corresponding accuracy metrics. By relying on a stateful architecture
and capitalizing the work carried out, Nirdizati is able to optimally exploit
multiprocessing.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>New Features</title>
      <p>Two new families of algorithms have been added to the tool, namely, incremental
learning and time series prediction algorithms. Furthermore, a new family of
intercase encodings has been made available in Nirdizati.</p>
      <p>
        While the previous version of Nirdizati mainly focused on predictive
models for outcome-based and time-related predictions, this version of the tool also
supports the creation and comparison of models predicting sequences of next
activities. To this aim, the tool has been equipped with time series prediction
based on two recurrent neural network algorithms: (i) Long Short Term
Memory Networks (LSTM), and (ii) Gated Recurrent Unit (GRU), which have been
proven to give competitive results in Predictive Process Monitoring [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        Nirdizati has also been enriched with incremental algorithms for carrying
out classi cation tasks. In particular, (i) Multinomial Nave Bayes, (ii) Stochastic
Gradient Descent (SGD) Classi er, (iii) Perceptron, and (iv) Neural Networks
have been introduced. We decided to include Multinomial Nave Bayes, since
it is a fairly common algorithm that is rather simple, yet generally working
pretty well on datasets with di erent characteristics [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. SGD Classi er and
Neural Networks showed to be rather e ective techniques in di erent elds,
while Perceptron is a particular case of SGD [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
      </p>
      <p>
        Finally, in order to de ne intercase encodings, the following intercase features
can now be used: (i) executed events per day, (ii) resources used per day, and
(iii) new cases per day. Eliciting and leveraging such features has shown to be
rather e ective in improving the accuracy of the trained predictive models [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>Extensive improvements on the usability of the tool have been carried out:
Log feature visualization. Once the user has uploaded an event log, the log
feature visualization functionality allows accessing information regarding the
log characteristics (e.g., the number of events and resources per day).
Dataset splitting, encoding and labeling. These functionalities enable the user
to split an event log into training and validation set by selecting the preferred
case order and sizes of the sets; label the cases, choosing among a prede ned
set of labeling criteria, and check the distribution of labels in the log; and
select the preferred encoding(s) to be used.</p>
      <p>
        Hyperparameter optimization. Hyperparameter optimization approaches
support users in tuning the hyperparameters to be used for training the
predictive models [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. Two possible hyperparameter optimization strategies
are available in Nirdizati, i.e., (i) Tree of Parzen Estimators (TPE), and
(ii) Random Search algorithm.
      </p>
      <p>Result visualization. The results can be ltered and visualized using
various interactive plotting strategies. The results page contains four elements:
(i) the con guration table, (ii) the results table, (iii) the pre x plot, and
(iv) the bubble chart plots. The con guration table summarizes, for each
predictive model, the con guration that originated the model, while the
results table reports the accuracy of the model (in terms of well-known
accuracy metrics, e.g., F-score and AUC) in tabular format. The results are also
provided in the pre x plot, which shows the trend of each metric for di erent
pre x lengths, and in the bubble chart plots, which enable the comparison
of the di erent predictive models with respect to various perspectives (e.g.,
the comparison of di erent encodings or classi cation algorithms).
4</p>
    </sec>
    <sec id="sec-4">
      <title>Concluding Remarks</title>
      <p>This paper presented the latest advancements of Nirdizati. Speci cally, its
backend has been redesigned to provide a reliable and e cient framework that
allows an easy comparison of di erent state-of-the-art Predictive Process
Monitoring approaches. Moreover, new features have been added, so that Nirdizati is
now able to run the most recent state-of-the-art techniques, such as
incremental learning algorithms, time series prediction algorithms, and intercase feature
encodings.</p>
      <p>
        The recent stream of publications in the Predictive Process Monitoring eld [
        <xref ref-type="bibr" rid="ref12 ref13 ref15 ref17 ref2 ref5">2,
5, 12, 13, 15, 17</xref>
        ] shows the need for tools able to support researchers and users
in analyzing, comparing and selecting the techniques that are the most
suitable for them. This need is also re ected in the growth of Predictive Process
Monitoring plug-ins in well known process mining tools such as ProM [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and
Apromore [
        <xref ref-type="bibr" rid="ref11 ref18">11, 18</xref>
        ]. Nirdizati is a completely dedicated tool for running a very
rich set of Predictive Process Monitoring techniques and its latest advancements
make it even more robust, scalable and usable.
      </p>
      <p>
        We assess the current Technology Readiness Level of Nirdizati to be 5. This
release o ers indeed a well-de ned structure of the software and code
documentation;5 moreover, it is equipped with a very large test suite, and a Continuous
Integration deployment pipeline. The tool has been extensively used and its
features exercised on both simulated and real data, in the medical [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ],
administrative [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and nancial domain [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]. We believe that all these reasons make
Nirdizati a mature and useful instrument for the BPM community.
      </p>
      <sec id="sec-4-1">
        <title>5 https://nirdizati-research.readthedocs.io/</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>1. 3TU Data Center: BPI Challenge 2011 Event Log (</article-title>
          <year>2011</year>
          ), http://dx.doi.org/10. 4121/uuid:
          <fpage>d9769f3d</fpage>
          -0ab0
          <string-name>
            <surname>-</surname>
          </string-name>
          4fb8
          <string-name>
            <surname>-</surname>
          </string-name>
          803b-0d1120ffcf54
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.M.</given-names>
            ,
            <surname>Teinemaa</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>Clustering-based predictive process monitoring</article-title>
          .
          <source>IEEE Transactions on Services Computing</source>
          pp.
          <volume>1</volume>
          {
          <issue>1</issue>
          (
          <year>2018</year>
          ). https://doi.org/10.1109/TSC.
          <year>2016</year>
          .2645153
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Federici</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ghidini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.M.</given-names>
            ,
            <surname>Rizzi</surname>
          </string-name>
          ,
          <string-name>
            <surname>W.</surname>
          </string-name>
          :
          <article-title>Predictive business process monitoring framework with hyperparameter optimization</article-title>
          .
          <source>In: CAiSE 2016</source>
          . pp.
          <volume>361</volume>
          {
          <issue>376</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Federici</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ghidini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.M.</given-names>
            ,
            <surname>Rizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            ,
            <surname>Simonetto</surname>
          </string-name>
          , L.:
          <article-title>Genetic algorithms for hyperparameter optimization in predictive business process monitoring</article-title>
          .
          <source>Inf. Syst</source>
          .
          <volume>74</volume>
          (
          <issue>Part</issue>
          ),
          <volume>67</volume>
          {
          <fpage>83</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Ghidini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.M.</given-names>
            ,
            <surname>Milani</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>Predictive process monitoring methods: Which one suits me best?</article-title>
          <source>In: BPM 2018</source>
          . pp.
          <volume>462</volume>
          {
          <issue>479</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. van Dongen,
          <string-name>
            <given-names>B.F.</given-names>
            ,
            <surname>de Medeiros</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.K.A.</given-names>
            ,
            <surname>Verbeek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.M.W.</given-names>
            ,
            <surname>Weijters</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.J.M.M.</given-names>
            ,
            <surname>van der Aalst</surname>
          </string-name>
          ,
          <string-name>
            <surname>W.M.P.</surname>
          </string-name>
          :
          <article-title>The ProM framework: A new era in process mining tool support</article-title>
          .
          <source>In: ICATPN 2005</source>
          . pp.
          <volume>444</volume>
          {
          <issue>454</issue>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>van Dongen</surname>
            <given-names>B. F.</given-names>
          </string-name>
          :
          <source>BPI Challenge</source>
          <year>2012</year>
          (
          <year>2012</year>
          ), http://dx.doi.org/10.4121/ uuid:
          <fpage>3926db30</fpage>
          -f712
          <string-name>
            <surname>-</surname>
          </string-name>
          4394
          <string-name>
            <surname>-</surname>
          </string-name>
          aebc-75976070e91f
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>van Dongen</surname>
            <given-names>B. F.</given-names>
          </string-name>
          :
          <source>BPI Challenge</source>
          <year>2015</year>
          (
          <year>2015</year>
          ), http://dx.doi.org/10.4121/ uuid:
          <fpage>31a308ef</fpage>
          -c844
          <string-name>
            <surname>-</surname>
          </string-name>
          48da
          <string-name>
            <surname>-</surname>
          </string-name>
          948c-305d167a0ec1
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>van Dongen</surname>
            <given-names>B. F.</given-names>
          </string-name>
          :
          <source>BPI Challenge</source>
          <year>2017</year>
          (
          <year>2017</year>
          ), https://doi.org/10.4121/uuid:
          <fpage>3926db30</fpage>
          -f712
          <string-name>
            <surname>-</surname>
          </string-name>
          4394
          <string-name>
            <surname>-</surname>
          </string-name>
          aebc-75976070e91f
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Jorbina</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rozumnyi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verenich</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ghidini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.M.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>La</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Raboczi</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Nirdizati: A web-based tool for predictive process monitoring</article-title>
          .
          <source>In: BPM Demo Track and BPM Dissertation Award</source>
          ,
          <string-name>
            <surname>BPM</surname>
          </string-name>
          <year>2017</year>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>La</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Reijers</surname>
          </string-name>
          , H.A.,
          <string-name>
            <surname>van der Aalst</surname>
            ,
            <given-names>W.M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dijkman</surname>
            ,
            <given-names>R.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendling</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garc</surname>
          </string-name>
          a-Ban~uelos, L.:
          <article-title>APROMORE: an advanced process model repository</article-title>
          .
          <source>Expert Syst. Appl</source>
          .
          <volume>38</volume>
          (
          <issue>6</issue>
          ),
          <volume>7029</volume>
          {
          <fpage>7040</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Leontjeva</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Conforti</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.M.:</surname>
          </string-name>
          <article-title>Complex symbolic sequence encodings for predictive monitoring of business processes</article-title>
          .
          <source>In: BPM 2015</source>
          . pp.
          <volume>297</volume>
          {
          <issue>313</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Maggi</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ghidini</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          :
          <article-title>Predictive monitoring of business processes</article-title>
          .
          <source>In: CAiSE 2014</source>
          . pp.
          <volume>457</volume>
          {
          <issue>472</issue>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Maisenbacher</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weidlich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Handling concept drift in predictive process monitoring</article-title>
          .
          <source>In: IEEE SCC</source>
          <year>2017</year>
          . pp.
          <volume>1</volume>
          {
          <issue>8</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Senderovich</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Di Francescomarino</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghidini</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jorbina</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maggi</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          :
          <article-title>Intra and inter-case features in predictive process monitoring: A tale of two dimensions</article-title>
          .
          <source>In: BPM</source>
          <year>2017</year>
          ,
          <article-title>Proceedings</article-title>
          . pp.
          <volume>306</volume>
          {
          <issue>323</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Tax</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verenich</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>La</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          :
          <article-title>Predictive business process monitoring with LSTM neural networks</article-title>
          .
          <source>In: CAiSE 2017</source>
          . pp.
          <volume>477</volume>
          {
          <issue>492</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Teinemaa</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maggi</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Di</given-names>
            <surname>Francescomarino</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          :
          <article-title>Predictive business process monitoring with structured and unstructured data</article-title>
          .
          <source>In: BPM 2016</source>
          . pp.
          <volume>401</volume>
          {
          <issue>417</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Verenich</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Mo~skovski,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Raboczi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>La</given-names>
            <surname>Rosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Maggi</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.M.:</surname>
          </string-name>
          <article-title>Predictive process monitoring in Apromore</article-title>
          .
          <source>In: Information Systems in the Big Data Era - CAiSE Forum</source>
          <year>2018</year>
          , Proceedings. pp.
          <volume>244</volume>
          {
          <issue>253</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , T.:
          <article-title>Solving large scale linear prediction problems using stochastic gradient descent algorithms</article-title>
          . In: ICML (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>