<!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>Enhancing the Quality of Predictions in Predictive B usiness Process Monitoring</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jongchan Kim</string-name>
          <email>jckim@unist.ac.kr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ulsan National Institute of Science and Technology (UNIST)</institution>
          ,
          <addr-line>50, UNIST-gil, Ulsan 44919</addr-line>
          ,
          <country>Republic of Korea</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The aim of this thesis is to develop and evaluate methods to enhance the quality of predictions for predictive business process monitoring, focusing on the accuracy and stability of predictions. Three different approaches to increase the accuracy and stability of predictions are suggested. Firstly, to improve the accuracy of predictions on minority classes, di erent resampling techniques are applied to data samples in event logs and the accuracy of the predictions from these resampling techniques are compared, and new metric that considers di erent weights of activities is developed. Secondly, the stability of predictions of di erent data distribution-resampling technique pairs is compared. Lastly, the stability of predictions of di erent case types in event logs is compared, and a new performance metric that considers di erent case types and provides balanced predictions is suggested. Besides evaluation using publicly available event logs, a case study is also conducted using a real-life event log from a large hospital in South Korea.</p>
      </abstract>
      <kwd-group>
        <kwd>Business process predictive monitoring stability</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The goal of predictive business process monitoring is to predict various aspects
of interest of business processes, such as the next event in a case [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], process
outcomes [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], or remaining time in a case [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], by enabling real-time prediction of the
features based on an incomplete event log. Predictive business process monitoring
is of paramount importance since not only does it help decision makers be better
prepared for what is going to happen in the future, but it also prevents them
from facing huge costs due to highly uncertain business environments. In order
to maximize the advantage of predictive business process monitoring, it is widely
acknowledged to increase the prediction accuracy. Hence, all approaches in the
literature are evaluated considering the accuracy of predictions on a set of real
world and/or synthetic event logs. Accuracy improvements can be achieved
either by modifying the data preprocessing scheme or training algorithms. Firstly,
incomplete traces can be manipulated using di erent encoding techniques in a
preprocessing step [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. As di erent encoding techniques are implemented, the
way in which the traces are characterized changes, thereby leading to better
representation of traces for classi ers to train. Secondly, di erent classi ers can
be employed to t the training data followed by the rising number of advanced
classi ers proposed in machine learning eld that show superior performances
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In recent years, growing number of researchers have intensively conducted
research on predictive business process monitoring, applying various techniques
to enhance the accuracy of predictions in predictive business process monitoring.
      </p>
      <p>
        While techniques proposed in the literature are thoroughly evaluated from
the point of view of performance, e.g., accuracy of f-score of predictions, we argue
that little emphasis has been put on the practical applicability of the prediction
results. Therefore, it remains unclear to what extent predictive monitoring can
improve the business processes in practice. Speci cally, the data mining and
machine learning literature stresses that other dimensions of quality of the results
achieved by a model, besides accuracy, should be considered in order to achieve
a comprehensive evaluation of a predictive model. In particular, the accuracy
and stability of the predictions have not been examined enough in predictive
business process monitoring, while they are deemed important in data mining
and machine learning [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        For a clearer understanding, let us consider the following two examples. First,
let us assumes that a manufacturing company needs to detect anomalous traces
in a process as early as possible in order to minimize the cost of defects resulting
from anomalous process execution. Since anomalous traces usually do not
account for the majority of traces, enough data samples for anomalous traces may
not be available, which hinders the capability of a classi er of learning a model
of decent quality for tting the anomalous traces. Assuming that the
anomalous traces account for 10% of traces, and the prediction accuracy measured by
f-score is 0.9 and 0.1 for the normal traces and anomalous traces, respectively,
the average accuracy of this classi er is 0.82, even though the prediction
accuracy of the anomalous traces is only 0.1. To conclude, the gap between the
prediction accuracy of the minority class and the average prediction accuracy is
immense, thereby making the classi er virtually unusable in practice. In the
second example, let us assume that an insurance company wants to predict the next
activity in running processes in order to e ciently handle the ongoing workload.
In this case, predictive monitoring would be useless in practice if predictions
and performance are not stable across a variety of dimensions, such as time, i.e.,
predictions are di erent with every di erent trial, or distribution of case types,
i.e., predictions are very accurate for speci c case types and highly inaccurate
for others. While research has analysed the temporal stability of predictions in
outcome-based predictive monitoring [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], a more general analysis of quality of
predictions across di erent dimensions of interest remains largely undiscovered.
      </p>
      <p>In this context, this thesis aims to bridge the gap between academia and
practice by proposing techniques for enhancing the accuracy and stability of
predictions in predictive business process monitoring. This thesis will focus on
the prediction of next activity in a case and process outcomes. As the prediction
of next activity is a sequential multi-class classi cation task, while the prediction
of the overall outcome is a non-sequential binary classi cation task, preprocessing
schemes for these two types of predictions will be di erent. For the data, we will
consider publicly available event logs and also real-life event log from a large
hospital in South Korea. A case study will be presented using the real-life event
log in order to enhance the practical applicability of the results of the thesis.</p>
      <p>This thesis was scheduled to be completed in three years, where
approximately two years are remaining for now. During the rst year, the literature on
accuracy and stability of predictions in predictive business process monitoring,
resampling techniques in machine learning, and trace clustering techniques in
process mining were thoroughly investigated. In addition, di erent resampling
techniques for imbalanced learning were partly implemented. For the second
year, the remaining analysis of the rst approach and a case study will be
conducted. For the case study, the collection of real-life event log from the hospital
will be nished and the evnet log will be preprocessed. Especially in the process
of collecting the real-life event log, domain experts in the hospital such as doctors
and nurses will be interviewed for the advice of di erent weighting schemes for
di erent activities. In addition, probability distributions will be tted to either
augmented or reduced data for the second approach. In the last year, stability
of the prediction from each "data distribution - resampling technique" pair will
be calculated to gure out the optimal conditions for stable predictions. Finally,
various trace clustering techniques will be applied and the stability of the
prediction from each trace clustering technique will be calculated for the analysis
of third approach. After the experiments, the limitation of the paper will be
unveiled and concrete scope of the future research will be determined based on
the assessed limitations.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Approach</title>
      <p>At the current stage of the research, three existing issues in accuracy and stability
of the predictions in predictive business process monitoring have been identi ed.
These three issues concerns predictive monitoring use cases that are solved using
classi cation techniques, i.e., prediction of next activity in a running trace and
prediction of process outcomes.
2.1</p>
      <sec id="sec-2-1">
        <title>First approach: Comparison of the accuracy of predictions of di erent resampling techniques for imbalanced learning</title>
        <p>
          The imbalance in class ratio of features in an event log decreases accuracy of
the predictions. Most popular classi cation techniques show poor performance
when they have imbalanced data as input data [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. Therefore, this thesis
compares di erent resampling techniques to balance the class ratio of features and
shows how resampling techniques improve the accuracy of the predictions, and
the detailed framework is presented in Fig. 1. The resampling techniques to be
used in the thesis are composed of over-sampling techniques and under-sampling
techniques. For performance measurement, a new metric that calculates
prediction accuracy based on modi ed weights of activities is developed, where the
weights are modi ed with the help of domain experts. In a nutshell, this new
accuracy metric gives larger penalty to the wrong prediction of a class that has
higher weight.
        </p>
        <p>Over-Sampling Over-sampling techniques augment the number of samples in
the minority class by sampling from the minority class. Three existing
oversampling techniques will be compared.</p>
        <p>Under-Sampling Under-sampling techniques delete samples from the majority
class. Ten existing undersampling techniques are compared.</p>
        <p>In practice, the problem of imbalanced class ratio becomes more evident
when the minority class is considered to be a critical task in the operation of
the process. In this case, wrong prediction of minority class may bring huge
damage to those who run the corresponding process even though the classi er is
good at predicting the majority class. In order to account for the importance of
predicting the minority class, the penalty is given to the recall of the minority
class, thereby modifying the f-score. To better demonstrate the e ectiveness of
resampling techniques, a case study will be presented using a real-life event log
from a large hospital in Korea.</p>
      </sec>
      <sec id="sec-2-2">
        <title>Second approach: Comparison of the stability of predictions of di erent "data distribution-resampling technique" pairs</title>
        <p>Di erent data distribution may a ect the stability of the predictions. Once the
resampling technique is applied, the data will either be augmented or deleted. In
addition, the way in which the data is augmented or deleted varies depending on
which resampling technique is applied. In other words, the distribution after the
application of resampling techniques can be totally di erent from the
distribution of the data where di erent resampling techniques are applied, even though
the initial data distribution was identical. Therefore, this thesis compares
prediction performance and the stability of di erent "data distribution-resampling
technique" pairs as in Fig. 3. In a bimodal distribution where the value of one
mode is slightly higher than the other mode, for instance, one oversampling
technique may augment the number of minority class by focusing only on increasing
the samples that belong to the mode that has higher value, whereas the other
oversampling technique may augment the number of minority class by increasing
the samples that belong to both modes. In this case, the stability of the
classiers of two oversampling techniques is expected to be di erent. Moreover, there
may exist speci c types of classi ers that can generate more solid rules for tting
the data depending on di erent distribution of the input data. Therefore, it is
expected that the best classi er for each resampling technique will be revealed
after experiments.</p>
        <p>In addition, e ects of di erent sizes of the data modi ed by resampling
techniques on accuracy and stability can be an another subtopic of interest in this
context. For example, over-sampling techniques may relatively show greater
accuracy and stability on huge dataset, but not in a case where the majority class
has 10 samples and minority class has only 1 sample. In this case, under-sampling
techniques may relatively show greater accuracy and stability where the
oversampling technique has to over-sample based on only 1 sample, thereby resulting
in a poorer accuracy and stability. Here, we will use case-based strati ed
sampling that samples data based on case-level, which means that the distribution
of the data is maintained by deleting cases, not by deleting individual events.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Third approach: Comparison of the stability of predictions of di erent case types</title>
        <p>
          Di erent case types may a ect the stability of the predictions, which means
that the prediction accuracy may uctuate at times depending on di erent case
types. Therefore, this thesis compares prediction performance and the stability
of di erent case types as in Fig. ??. There have been several research regarding
grouping the cases based on features [
          <xref ref-type="bibr" rid="ref1 ref6">6, 1</xref>
          ], which is frequently called as trace
clustering. The idea of comparing the stability of predictions of di erent case
types stem from the fact that di erent case types have di erent variations in
their features. In addition, consideration of di erent case types can be helpful
in practice, since the classi er can o er tailored prediction results for each case
type, thereby providing more stable predictions for each case type. If not, the
prediction accuracy may uctuate across each trial depending on the
distribution of di erent case types in a training set. The case types will be identi ed
by trace clustering techniques suggested in BPM literature and other
clustering techniques suggested in traditional machine learning literature. After the
identi cation of di erent case types, new performance metric that account for
balanced predictions across case types will be devised.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Discussion and Conclusion</title>
      <p>It is expected in the rst approach that the prediction accuracy of classi ers
with resampling techniques calculated by new metric would be higher than that
of a baseline classi er without any resampling techniques. Beyond these results,
it is expected in the second approach that speci c distribution of event logs
whose samples are either augmented or deleted may show stable prediction
accuracy with speci c classi ers. Similarly, in the third approach, it is expected
that clusters of cases from some trace clustering techniques may exhibit stable
prediction accuracies across every trial. For future works, four improvements can
be made. Firstly, further e orts can be made on developing ways to give penalty
to the wrong predictions of the minority class. Throughout this paper, it was
suggested that f-score should be modi ed by penalizing the recall of the minority
class, which means that the penalty is imposed after the classi er is tted and
completes the prediction. However, the penalty can be given not only by
modifying the f-score but by modifying the way the classi er calculates the error in
learning procedure. In case of neural network-based classi ers, cost function can
be modi ed, while in tree-based classi ers, cost complexity or entropy can be
modi ed. In these cases, conventional performance metrics will be applied
without any modi cation. Secondly, better ways to de ne "important" minority class
can be developed. This is because in real-life cases, there can be a huge number
of minority classes, while some of these cases are not "important" classes but
merely minor or deviant classes. Thirdly, other advanced quality metrics of
predictions from the literature in machine learning except for the stability would be
implemented to improve the quality of predictions for predictive business process
monitoring. Lastly, generative models can further be applied in oversampling the
minority class since not enough over-sampling techniques are considered in this
thesis compared to under-sampling techniques.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>R. J. C.</given-names>
            <surname>Bose</surname>
          </string-name>
          and
          <string-name>
            <surname>W. M. Van der Aalst</surname>
          </string-name>
          .
          <article-title>Context aware trace clustering: Towards improving process mining results</article-title>
          .
          <source>In Proceedings of the 2009 SIAM International Conference on Data Mining</source>
          , pages
          <volume>401</volume>
          {
          <fpage>412</fpage>
          .
          <string-name>
            <surname>SIAM</surname>
          </string-name>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>J.</given-names>
            <surname>Evermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Rehse</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Fettke</surname>
          </string-name>
          .
          <article-title>Predicting process behaviour using deep learning</article-title>
          .
          <source>Decision Support Systems</source>
          ,
          <volume>100</volume>
          :
          <fpage>129</fpage>
          {
          <fpage>140</fpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>M.</given-names>
            <surname>Kukar</surname>
          </string-name>
          and I. Kononenko.
          <article-title>Reliable classi cations with machine learning</article-title>
          .
          <source>In European Conference on Machine Learning</source>
          , pages
          <volume>219</volume>
          {
          <fpage>231</fpage>
          . Springer,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>A.</given-names>
            <surname>Metzger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Leitner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ivanovic</surname>
          </string-name>
          , E. Schmieders,
          <string-name>
            <given-names>R.</given-names>
            <surname>Franklin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Carro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dustdar</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Pohl</surname>
          </string-name>
          .
          <article-title>Comparing and combining predictive business process monitoring techniques</article-title>
          .
          <source>IEEE Transactions on Systems, Man, and Cybernetics: Systems</source>
          ,
          <volume>45</volume>
          (
          <issue>2</issue>
          ):
          <volume>276</volume>
          {
          <fpage>290</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>A.</given-names>
            <surname>Rogge-Solti</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Weske</surname>
          </string-name>
          .
          <article-title>Prediction of remaining service execution time using stochastic petri nets with arbitrary ring delays</article-title>
          .
          <source>In ICSOC</source>
          , pages
          <volume>389</volume>
          {
          <fpage>403</fpage>
          . Springer,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.</given-names>
            <surname>Song</surname>
          </string-name>
          , C. W. Gunther, and
          <string-name>
            <surname>W. M. Van der Aalst</surname>
          </string-name>
          .
          <article-title>Trace clustering in process mining</article-title>
          .
          <source>In BPM</source>
          , pages
          <volume>109</volume>
          {
          <fpage>120</fpage>
          . Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Wong</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Kamel</surname>
          </string-name>
          .
          <article-title>Classi cation of imbalanced data: A review</article-title>
          .
          <source>International Journal of Pattern Recognition and Arti cial Intelligence</source>
          ,
          <volume>23</volume>
          (
          <issue>04</issue>
          ):
          <volume>687</volume>
          {
          <fpage>719</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>N.</given-names>
            <surname>Tax</surname>
          </string-name>
          , I. Verenich,
          <string-name>
            <given-names>M. La</given-names>
            <surname>Rosa</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          .
          <article-title>Predictive business process monitoring with lstm neural networks</article-title>
          .
          <source>In International Conference on Advanced Information Systems Engineering</source>
          , pages
          <volume>477</volume>
          {
          <fpage>492</fpage>
          . Springer,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>I.</given-names>
            <surname>Teinemaa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Leontjeva</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          .
          <article-title>Temporal stability in predictive process monitoring</article-title>
          .
          <source>Data Mining and Knowledge Discovery</source>
          ,
          <volume>32</volume>
          (
          <issue>5</issue>
          ):
          <volume>1306</volume>
          {
          <fpage>1338</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. I. Teinemaa,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Rosa</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          .
          <article-title>Outcome-oriented predictive process monitoring: Review and benchmark</article-title>
          .
          <source>ACM Transactions on Knowledge Discovery from Data (TKDD)</source>
          ,
          <volume>13</volume>
          (
          <issue>2</issue>
          ):
          <fpage>17</fpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>