Adriano Augusto
University of Tartu
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Adriano Augusto.
international conference on conceptual modeling | 2016
Adriano Augusto; Raffaele Conforti; Marlon Dumas; Marcello La Rosa; Giorgio Bruno
This paper addresses the problem of discovering business process models from event logs. Existing approaches to this problem strike various tradeoffs between accuracy and understandability of the discovered models. With respect to the second criterion, empirical studies have shown that block-structured process models are generally more understandable and less error-prone than unstructured ones. Accordingly, several automated process discovery methods generate block-structured models by construction. These approaches however intertwine the concern of producing accurate models with that of ensuring their structuredness, sometimes sacrificing the former to ensure the latter. In this paper we propose an alternative approach that separates these two concerns. Instead of directly discovering a structured process model, we first apply a well-known heuristic that discovers more accurate but sometimes unstructured (and even unsound) process models, and then transform the resulting model into a structured one. An experimental evaluation shows that our “discover and structure” approach outperforms traditional “discover structured” approaches with respect to a range of accuracy and complexity measures.
data and knowledge engineering | 2018
Adriano Augusto; Raffaele Conforti; Marlon Dumas; Marcello La Rosa; Giorgio Bruno
This article tackles the problem of discovering a process model from an event log recording the execution of tasks in a business process. Previous approaches to this reverse-engineering problem strike different tradeoffs between the accuracy of the discovered models and their understandability. With respect to the latter property, empirical studies have demonstrated that block-structured process models are generally more understandable and less error-prone than unstructured ones. Accordingly, several methods for automated process model discovery generate block-structured models only. These methods however intertwine the objective of producing accurate models with that of ensuring their structuredness, and often sacrifice the former in favour of the latter. In this paper we propose an alternative approach that separates these concerns. Instead of directly discovering a structured process model, we first apply a well-known heuristic that discovers accurate but oftentimes unstructured (and even unsound) process models, and then we transform the resulting process model into a structured (and sound) one. An experimental evaluation on synthetic and real-life event logs shows that this discover-and-structure approach consistently outperforms previous approaches with respect to a range of accuracy and complexity measures.
Knowledge and Information Systems | 2018
Adriano Augusto; Raffaele Conforti; Marlon Dumas; Marcello La Rosa; Artem Polyvyanyy
The problem of automated discovery of process models from event logs has been intensively researched in the past two decades. Despite a rich field of proposals, state-of-the-art automated process discovery methods suffer from two recurrent deficiencies when applied to real-life logs: (i) they produce large and spaghetti-like models; and (ii) they produce models that either poorly fit the event log (low fitness) or over-generalize it (low precision). Striking a trade-off between these quality dimensions in a robust and scalable manner has proved elusive. This paper presents an automated process discovery method, namely Split Miner, which produces simple process models with low branching complexity and consistently high and balanced fitness and precision, while achieving considerably faster execution times than state-of-the-art methods, measured on a benchmark covering twelve real-life event logs. Split Miner combines a novel approach to filter the directly-follows graph induced by an event log, with an approach to identify combinations of split gateways that accurately capture the concurrency, conflict and causal relations between neighbors in the directly-follows graph. Split Miner is also the first automated process discovery method that is guaranteed to produce deadlock-free process models with concurrency, while not being restricted to producing block-structured process models.
IEEE Transactions on Knowledge and Data Engineering | 2018
Adriano Augusto; Raffaele Conforti; Marlon Dumas; Marcello La Rosa; Fabrizio Maria Maggi; Andrea Marrella; Massimo Mecella; Allar Soo
Process mining allows analysts to exploit logs of historical executions of business processes to extract insights regarding the actual performance of these processes. One of the most widely studied process mining operations is automated process discovery. An automated process discovery method takes as input an event log, and produces as output a business process model that captures the control-flow relations between tasks that are observed in or implied by the event log. Various automated process discovery methods have been proposed in the past two decades, striking different tradeoffs between scalability, accuracy, and complexity of the resulting models. However, these methods have been evaluated in an ad-hoc manner, employing different datasets, experimental setups, evaluation measures, and baselines, often leading to incomparable conclusions and sometimes unreproducible results due to the use of closed datasets. This article provides a systematic review and comparative evaluation of automated process discovery methods, using an open-source benchmark and covering 12 publicly-available real-life event logs, 12 proprietary real-life event logs, and nine quality metrics. The results highlight gaps and unexplored tradeoffs in the field, including the lack of scalability of some methods and a strong divergence in their performance with respect to the different quality metrics used.
Science & Engineering Faculty | 2017
Adriano Augusto; Raffaele Conforti; Marlon Dumas; Marcello La Rosa; Fabrizio Maria Maggi; Andrea Marrella; Massimo Mecella; Allar Soo
international conference on data mining | 2017
Adriano Augusto; Raffaele Conforti; Marlon Dumas; Marcello La Rosa
business process management | 2018
Adriano Augusto; Abel Armas-Cervantes; Raffaele Conforti; Marlon Dumas; Marcello La Rosa; Daniel Reißner
Science & Engineering Faculty | 2017
Adriano Augusto; Raffaele Conforti; Marlon Dumas; Marcello La Rosa; Giorgio Bruno
School of Information Systems; Science & Engineering Faculty | 2017
Adriano Augusto; Raffaele Conforti; Marlon Dumas; Marcello La Rosa
School of Information Systems; Science & Engineering Faculty | 2017
Adriano Augusto; Raffaele Conforti; Marlon Dumas; Marcello La Rosa