<!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>ProcessGold: Enterprise Process Mining</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>1st Roeland Scheepens</string-name>
          <email>roeland.scheepens@processgold.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>2nd Erik-Jan van der Linden</string-name>
          <email>erik-jan.vanderlinden@processgold.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Head of Research, ProcessGold</institution>
          ,
          <addr-line>Eindhoven</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Non-Executive Director, ProcessGold</institution>
          ,
          <addr-line>Eindhoven</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>-The ProcessGold Enterprise Platform offers innovative features that are required for mature, scalable, and secure use of Process Mining throughout large enterprises. Processes are displayed using process graphs, which require stable layouts to ensure continued use by business users. The platform uses a novel graph layout algorithm, called Tracy, that ensures this stability over user interaction. Relevance of enterprise features in general is evident from the dispersion of process mining in enterprises, from use cases, and from broad adoption of the Platform. Index Terms-Process mining, Enterprise process mining, stable graph layout</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>Since its inception around the turn of the century [AGL98],
the first decade of Process Mining [Aal16] saw the
development from academic use and academic tools, such as
ProM [vDdMV 05], to stand-alone tooling for use by
individual analysts in businesses. The second decade, since around
2010, has been characterized by increasing use of and interest
in process mining of non-technical business users in large
enterprises.</p>
    </sec>
    <sec id="sec-2">
      <title>II. COMMON FEATURES</title>
      <p>The above development has led to a number of properties that
are by now common in Process Mining platforms.</p>
      <p>Firstly, Process Mining tools have become part of the
system landscape of enterprises, which requires server- and
web-based architectures, and full compliance with standard
technical enterprise requirements such as data preparation on
board, collaborative development, controlled deployment, and
security.</p>
      <p>Secondly, dispersion to non-technical business users
requires easy point-and-click applications for everyday use, and
hence Process Mining has naturally integrated with Data
Analytics. This way, users have full access to required functionality
from the field of Data Analytics. This includes any kind of
business graphic besides process graphs, and full navigation
options for selection, filtering, drill-down, etc. [Kei02].</p>
      <p>Thirdly, for non-technical users, Process Mining is not their
primary task, and they require an optimal balance between
time they spend working with the application on the one hand
and business value on the other hand. In practice, users expect
response times they experience in other web-based
applications. This performance requirement needs to be aligned with
the need for flexibility: when users apply, for example, edge
or event sliders, apply different process mining algorithms,
filter, or select different case ID’s for multidimensional process
mining, they are making different selections from the full event
data. Round trips to databases then hamper performance, and
hence in-memory architectures have become a standard feature
of enterprise process mining. Data selection, visualization, user
navigation, as well as process mining algorithms all run
inmemory.</p>
      <p>All features mentioned are part of the ProcessGold
Enterprise Platform. For a full overview of features see the
ProcessGold website [Pro] and sources below.</p>
      <p>III. NOVEL FEATURE: TRACY PROCESS GRAPH LAYOUT
Besides these, by now common, features that meet
requirements for enterprise use, graph layout has become a topic
which requires attention to ensure process mining is
continuously usable by business users. The ProcessGold Platform
includes a novel algorithm for process graph layout, Tracy1.
A full technical paper about Tracy is available [MSW19].</p>
      <sec id="sec-2-1">
        <title>A. Process layout</title>
        <p>Since its inception, Process Mining has mainly relied on
existing algorithms for graph layout [GKN15]. However, these only
use the graph topology to compute a layout and do not make
use of the particular properties of processes. For example,
most processes have some sort of a main path [RBRB06],
[AEHK10] that is often the most frequent behavior. To fit
with intuitive semantics of process graphs, this path needs to
be centralized in the layout and depicted as a straight path
through the graph. While existing techniques fail to properly
do this [GKN15], the Tracy approach implements this.</p>
      </sec>
      <sec id="sec-2-2">
        <title>B. Stable process graphs</title>
        <p>Interaction with process graphs, required by business users,
by means of sliders, filtering, drill-down and alike leads to
changes in the layout of process graphs. Users build mental
maps of these graphs. When the graph changes, users need
to fit their mental model with the altered graph. Conventional
algorithms [GKN15] lead to smaller or larger changes, and
require users to at least put in significant cognitive effort
to adapt their mental map, but in the worst case even to
rebuild their mental map altogether. Graph layout stability
1Patent pending.
helps preserve the mental map of the user [PHG06], [ZKS11],
significantly reducing cognitive load.</p>
        <p>Therefore, we need to preserve the mental map when a
new graph layout is displayed. The three models of Misue
[MELS95] to represent the mental map are our starting point
to accomplish this. These models state that a layout adjustment
should preserve the direction of node n to node m for each pair
of nodes n and m, that nodes that are close together should
remain close together, and that graphical objects in a region
should stay in that region.</p>
        <p>In online dynamic graph drawing [BBDW17], graph layouts
need to be computed for a sequence of graphs without knowing
the full sequence from the beginning. In contrast, in offline
dynamic graph drawing [BBDW17], the whole sequence of
graphs is known up front. Interactive Process Mining is offline
in the sense that we know which graphs we can potentially
encounter, since any filtered graph will be a subset of the data
found in the event log, but it is also online because we do not
know the exact sequence of graphs beforehand. The
Tracyapproach presents a novel way to take this into account, and
results in layouts that are stable for the user.</p>
        <p>Stability vs quality: Besides stability, we also require
layouts to be of high quality. Stability and quality are two
conflicting requirements: graph layout stability helps preserve
the mental map of the user, but also restricts the graph layout
algorithm in optimizing layout quality. A way of dealing with
this conflict is to allow somewhat larger changes to the layout
and to make use of animation and transitioning as a secondary
approach to mental map preservation. The combination of
layout stability and transitioning provides the best approach
to preserving the mental map.</p>
      </sec>
      <sec id="sec-2-3">
        <title>C. Graph layout: Tracy</title>
        <p>Tracy is a novel stable layout algorithm for process graphs
that computes layouts that intuitively represent the semantics
of the process. Our algorithm is based on the Sugiyama
framework [STT81] but includes:</p>
        <p>A novel ranking algorithm;
A novel order constraint computation algorithm;</p>
        <p>A novel crossing minimization algorithm.</p>
        <p>In Figure 1, we present a comparison of Tracy and
conventional layout.</p>
        <p>Tracy is part of the production version of ProcessGold
starting from version 16, and will be publicly announced at
ICPM 2019.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>IV. MATURITY</title>
      <p>The ProcessGold Platform is a mature enterprise Process
Mining Platform. Customers of the platform include global
consulting firms, and global enterprises with over 1 billion
euro in annual turnover.</p>
      <p>A further indication of maturity is the business value that
customers get from implementing and using applications on
the platform. We present two use cases which illustrate this.</p>
      <sec id="sec-3-1">
        <title>A. Use cases</title>
        <p>Telecom provider: A telecom provider is faced by
increasing competition on price, requiring the need to reduce cost.
A process mining effort identifies and resolves a number
of process issues, in particular related to manual exception
handling, communication with strategic suppliers. This leads
to 20 percent personnel costs savings, and more broadly to 1+
M cost savings in general, which equals 300 percent return on
investment of the effort within 3 months.</p>
        <p>Insurance company: An insurance company is faced with
customers that are dissatisfied by untimely customer contacts.
Firstly, 71 percent of regular customer questions are not
responded to within the agreed service level, two days. A
process mining effort identifies incorrect routing of questions,
leading to delays. Once resolved, this dramatically improves
the timeliness. Secondly, in case of disease of a person having
a pension insurance, the company witnesses highly negative
comments from relatives on social media. These need to be
prevented for their negative impact on the reputation of the
company. In the process mining effort, the 15 percent of cases
where communication is not timely handled are identified
as well as the root causes, which are found in hand-over
over cases and consulting secondary systems. By-catch is
identification of 11 percent cost reduction.</p>
      </sec>
      <sec id="sec-3-2">
        <title>B. Scale</title>
        <p>Since 2016, customers and partners have acquired licenses for
use of the ProcessGold Platform for 10.000+ potential users.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>ACKNOWLEDGMENT</title>
      <p>Research and development presented in this demo paper was
carried out at ProcessGold. The authors acknowledge all
colleagues at ProcessGold that contributed to this work, as
well as academic partners at the Universities of Eindhoven (the
Netherlands) and RWTH Aachen (Germany) for productive
and long-lasting cooperation.
[Aal16]
[AEHK10]</p>
      <p>AALST W. M. P. V. D.: Process Mining: Data Science in
Action. Springer, Apr. 2016.</p>
      <p>ALBRECHT B., EFFINGER P., HELD M., KAUFMANN M.:
An automatic layout algorithm for BPEL processes. In
Proceedings of the 5th International Symposium on Software
Visualization (New York, NY, USA, 2010), SOFTVIS ’10,
ACM, pp. 173–182.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [AGL98] AGRAWAL R.,
          <string-name>
            <surname>GUNOPULOS D.</surname>
          </string-name>
          , LEYMANN F.:
          <article-title>Mining process models from workflow logs</article-title>
          .
          <source>In International Conference on Extending Database Technology</source>
          (
          <year>1998</year>
          ), Springer, pp.
          <fpage>467</fpage>
          -
          <lpage>483</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [BBDW17] BECK
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>BURCH</surname>
          </string-name>
          <string-name>
            <surname>M.</surname>
          </string-name>
          ,
          <string-name>
            <surname>DIEHL S.</surname>
          </string-name>
          , WEISKOPF D.
          <article-title>: A taxonomy and survey of dynamic graph visualization</article-title>
          .
          <source>Computer Graphics Forum 36</source>
          ,
          <issue>1</issue>
          (Jan.
          <year>2017</year>
          ),
          <fpage>133</fpage>
          -
          <lpage>159</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [GKN15]
          <string-name>
            <surname>GANSNER E. R.</surname>
          </string-name>
          ,
          <string-name>
            <surname>KOUTSOFIOS E.</surname>
          </string-name>
          , NORTH S.:
          <article-title>Drawing graphs with dot</article-title>
          .
          <source>Tech. rep., Graphviz</source>
          , Jan.
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [Kei02]
          <string-name>
            <surname>KEIM D. A.</surname>
          </string-name>
          :
          <article-title>Information visualization and visual data mining</article-title>
          .
          <source>IEEE transactions on Visualization and Computer Graphics</source>
          <volume>8</volume>
          ,
          <issue>1</issue>
          (
          <year>2002</year>
          ),
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [MELS95]
          <string-name>
            <surname>MISUE K.</surname>
          </string-name>
          ,
          <string-name>
            <surname>EADES P.</surname>
          </string-name>
          , LAI W., SUGIYAMA K.:
          <article-title>Layout adjustment and the mental map</article-title>
          .
          <source>Journal of Visual Languages &amp; Computing</source>
          <volume>6</volume>
          ,
          <issue>2</issue>
          (
          <year>June 1995</year>
          ),
          <fpage>183</fpage>
          -
          <lpage>210</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>[MSW19] MENNENS R. J.</surname>
          </string-name>
          , SCHEEPENS R.,
          <string-name>
            <surname>WESTENBERG M.</surname>
          </string-name>
          <article-title>A.: A stable graph layout algorithm for processes</article-title>
          .
          <source>Eurographics Conference on Visualization (EuroVis)</source>
          (
          <year>June 2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>[PHG06] PURCHASE H. C.</surname>
            , HOGGAN E.,
            <given-names>G O</given-names>
          </string-name>
          <string-name>
            <surname>¨RG C.</surname>
          </string-name>
          <article-title>: How important is the ”mental map”? - an empirical investigation of a dynamic graph layout algorithm</article-title>
          .
          <source>In Graph Drawing (Sept</source>
          .
          <year>2006</year>
          ), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, pp.
          <fpage>184</fpage>
          -
          <lpage>195</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [Pro]
          <article-title>PROCESSGOLD: ProcessGold - business intelligence and process mining platform</article-title>
          . https://processgold.com/en/. Accessed:
          <fpage>2019</fpage>
          -23-02.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <article-title>[RBRB06] RINDERLE S. B</article-title>
          ., BOBRIK R., REICHERT M. U., BAUER T.:
          <article-title>Business process visualization - use cases, challenges, solutions</article-title>
          .
          <source>In Proceedings of the Eighth International Conference on Enterprise Information Systems (ICEIS'06): Information System Analysis and Specification (May</source>
          <year>2006</year>
          ), INSTICC PRESS.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [STT81]
          <string-name>
            <surname>SUGIYAMA K.</surname>
          </string-name>
          , TAGAWA S., TODA M.
          <article-title>: Methods for visual understanding of hierarchical system structures</article-title>
          .
          <source>IEEE Transactions on Systems, Man, and Cybernetics 11</source>
          ,
          <issue>2</issue>
          (
          <year>1981</year>
          ),
          <fpage>109</fpage>
          -
          <lpage>125</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [vDdMV 05]
          <string-name>
            <surname>VAN DONGEN B. F</surname>
          </string-name>
          .,
          <string-name>
            <surname>DE MEDEIROS A. K</surname>
          </string-name>
          . A.,
          <string-name>
            <surname>VERBEEK H. M. W.</surname>
          </string-name>
          ,
          <string-name>
            <surname>WEIJTERS A. J. M. M.</surname>
          </string-name>
          ,
          <string-name>
            <surname>VAN DER AALST W. M. P.:</surname>
          </string-name>
          <article-title>The prom framework: A new era in process mining tool support</article-title>
          .
          <source>In Applications and Theory of Petri Nets</source>
          <year>2005</year>
          (Berlin, Heidelberg,
          <year>2005</year>
          ), Ciardo G.,
          <string-name>
            <surname>Darondeau</surname>
            <given-names>P.</given-names>
          </string-name>
          , (Eds.), Springer Berlin Heidelberg, pp.
          <fpage>444</fpage>
          -
          <lpage>454</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [ZKS11] ZAMAN L.,
          <string-name>
            <surname>KALRA A.</surname>
          </string-name>
          , STUERZLINGER W.:
          <article-title>The effect of animation, dual view, difference layers, and relative relayout in hierarchical diagram differencing</article-title>
          .
          <source>In Proceedings of Graphics Interface 2011 (GI'11)</source>
          (
          <year>2011</year>
          ),
          <source>Canadian HumanComputer Communications Society</source>
          , pp.
          <fpage>183</fpage>
          -
          <lpage>190</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>