Slice, mine and dice: complexity-aware automated discovery of business process models

  • Authors:

  • Chathura C. Ekanayake;Marlon Dumas;Luciano García-Bañuelos;Marcello La Rosa

  • Affiliations:

  • Queensland University of Technology, Australia;University of Tartu, Estonia;University of Tartu, Estonia;Queensland University of Technology, Australia

  • Venue:
  • BPM'13 Proceedings of the 11th international conference on Business Process Management
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Automated process discovery techniques aim at extracting models from information system logs in order to shed light into the business processes supported by these systems. Existing techniques in this space are effective when applied to relatively small or regular logs, but otherwise generate large and spaghetti-like models. In previous work, trace clustering has been applied in an attempt to reduce the size and complexity of automatically discovered process models. The idea is to split the log into clusters and to discover one model per cluster. The result is a collection of process models --- each one representing a variant of the business process --- as opposed to an all-encompassing model. Still, models produced in this way may exhibit unacceptably high complexity. In this setting, this paper presents a two-way divide-and-conquer process discovery technique, wherein the discovered process models are split on the one hand by variants and on the other hand hierarchically by means of subprocess extraction. The proposed technique allows users to set a desired bound for the complexity of the produced models. Experiments on real-life logs show that the technique produces collections of models that are up to 64% smaller than those extracted under the same complexity bounds by applying existing trace clustering techniques.