scholarly journals The RALph miner for automated discovery and verification of resource-aware process models

2020 ◽  
Vol 19 (6) ◽  
pp. 1415-1441
Author(s):  
Cristina Cabanillas ◽  
Lars Ackermann ◽  
Stefan Schönig ◽  
Christian Sturm ◽  
Jan Mendling
Keyword(s):  
Process Model ◽  
Model Verification ◽  
Process Models ◽  
Resource Assignment ◽  
Process Discovery ◽  
Event Logs ◽  
Different Types ◽  
Automated Discovery ◽  
And Performance ◽  
Resource Aware

Abstract Automated process discovery is a technique that extracts models of executed processes from event logs. Logs typically include information about the activities performed, their timestamps and the resources that were involved in their execution. Recent approaches to process discovery put a special emphasis on (human) resources, aiming at constructing resource-aware process models that contain the inferred resource assignment constraints. Such constraints can be complex and process discovery approaches so far have missed the opportunity to represent expressive resource assignments graphically together with process models. A subsequent verification of the extracted resource-aware process models is required in order to check the proper utilisation of resources according to the resource assignments. So far, research on discovering resource-aware process models has assumed that models can be put into operation without modification and checking. Integrating resource mining and resource-aware process model verification faces the challenge that different types of resource assignment languages are used for each task. In this paper, we present an integrated solution that comprises (i) a resource mining technique that builds upon a highly expressive graphical notation for defining resource assignments; and (ii) automated model-checking support to validate the discovered resource-aware process models. All the concepts reported in this paper have been implemented and evaluated in terms of feasibility and performance.

scholarly journals A task-level parallelism approach for process discovery

2018 ◽  
Vol 7 (4) ◽  
pp. 2446
Author(s):  
Muktikanta Sahu ◽  
Rupjit Chakraborty ◽  
Gopal Krishna Nayak
Keyword(s):  
Process Model ◽  
Process Mining ◽  
Programming Model ◽  
Parallel Implementation ◽  
Primary Objective ◽  
Process Models ◽  
Task Parallelism ◽  
Process Discovery ◽  
Event Logs ◽  
Computationally Intensive

Building process models from the available data in the event logs is the primary objective of Process discovery. Alpha algorithm is one of the popular algorithms accessible for ascertaining a process model from the event logs in process mining. The steps involved in the Alpha algorithm are computationally rigorous and this problem further manifolds with the exponentially increasing event log data. In this work, we have exploited task parallelism in the Alpha algorithm for process discovery by using MPI programming model. The proposed work is based on distributed memory parallelism available in MPI programming for performance improvement. Independent and computationally intensive steps in the Alpha algorithm are identified and task parallelism is exploited. The execution time of serial as well as parallel implementation of Alpha algorithm are measured and used for calculating the extent of speedup achieved. The maximum and minimum speedups obtained are 3.97x and 3.88x respectively with an average speedup of 3.94x.

scholarly journals Trace Clustering: A Preprocessing Method to Improve the Performance of Process Discovery

2021 ◽  
Vol 10 (09) ◽  
pp. 116-121
Author(s):  
Huiling LI ◽  
Shuaipeng ZHANG ◽  
Xuan SU
Keyword(s):  
Process Model ◽  
Process Mining ◽  
Process Models ◽  
Clustering Methods ◽  
Clustering Method ◽  
Model Quality ◽  
Process Discovery ◽  
Event Logs ◽  
Clustering Model ◽  
Preprocessing Method

The information system collects a large number of business process event logs, and process discovery aims to discover process models from the event logs. Many process discovery methods have been proposed, but most of them still have problems when processing event logs, such as low mining efficiency and poor process model quality. The trace clustering method allows to decompose original log to effectively solve these problems. There are many existing trace clustering methods, such as clustering based on vector space approaches, context-aware trace clustering, model-based sequence clustering, etc. The clustering effects obtained by different trace clustering methods are often different. Therefore, this paper proposes a preprocessing method to improve the performance of process discovery, called as trace clustering. Firstly, the event log is decomposed into a set of sub-logs by trace clustering method, Secondly, the sub-logs generate process models respectively by the process mining method. The experimental analysis on the datasets shows that the method proposed not only effectively improves the time performance of process discovery, but also improves the quality of the process model.

scholarly journals Process Discovery Enhancement with Trace Clustering and Profiling

2021 ◽  
Vol 5 (4) ◽  
pp. 1-13
Author(s):  
Muhammad Faizan ◽  
Megat F. Zuhairi ◽  
Shahrinaz Ismail
Keyword(s):  
Process Model ◽  
Process Mining ◽  
Process Models ◽  
Patient Treatment ◽  
Process Discovery ◽  
Processing Times ◽  
Data Process ◽  
Event Logs ◽  
Homogeneous Subset ◽  
Process Event

The potential in process mining is progressively growing due to the increasing amount of event-data. Process mining strategies use event-logs to automatically classify process models, recommend improvements, predict processing times, check conformance, and recognize anomalies/deviations and bottlenecks. However, proper handling of event-logs while evaluating and using them as input is crucial to any process mining technique. When process mining techniques are applied to flexible systems with a large number of decisions to take at runtime, the outcome is often unstructured or semi-structured process models that are hard to comprehend. Existing approaches are good at discovering and visualizing structured processes but often struggle with less structured ones. Surprisingly, process mining is most useful in domains where flexibility is desired. A good illustration is the "patient treatment" process in a hospital, where the ability to deviate from dealing with changing conditions is crucial. It is useful to have insights into actual operations. However, there is a significant amount of diversity, which contributes to complicated, difficult-to-understand models. Trace clustering is a method for decreasing the complexity of process models in this context while also increasing their comprehensibility and accuracy. This paper discusses process mining, event-logs, and presenting a clustering approach to pre-process event-logs, i.e., a homogeneous subset of the event-log is created. A process model is generated for each subset. These homogeneous subsets are then evaluated independently from each other, which significantly improving the quality of mining results in flexible environments. The presented approach improves the fitness and precision of a discovered model while reducing its complexity, resulting in well-structured and easily understandable process discovery results.

scholarly journals Performance of an automated process model discovery – the logistics process of a manufacturing company

2019 ◽  
Vol 11 (2) ◽  
pp. 106-118
Author(s):  
Michal Halaška ◽  
Roman Šperka
Keyword(s):  
Industry 4.0 ◽  
Process Models ◽  
Controlled Environment ◽  
Process Discovery ◽  
Event Logs ◽  
Manufacturing Company ◽  
Automated Process ◽  
Automated Discovery ◽  
Logistics Process ◽  
Discovery Algorithms

AbstractThe simulation and modelling paradigms have significantly shifted in recent years under the influence of the Industry 4.0 concept. There is a requirement for a much higher level of detail and a lower level of abstraction within the simulation of a modelled system that continuously develops. Consequently, higher demands are placed on the construction of automated process models. Such a possibility is provided by automated process discovery techniques. Thus, the paper aims to investigate the performance of automated process discovery techniques within the controlled environment. The presented paper aims to benchmark the automated discovery techniques regarding realistic simulation models within the controlled environment and, more specifically, the logistics process of a manufacturing company. The study is based on a hybrid simulation of logistics in a manufacturing company that implemented the AnyLogic framework. The hybrid simulation is modelled using the BPMN notation using BIMP, the business process modelling software, to acquire data in the form of event logs. Next, five chosen automated process discovery techniques are applied to the event logs, and the results are evaluated. Based on the evaluation of benchmark results received using the chosen discovery algorithms, it is evident that the discovery algorithms have a better overall performance using more extensive event logs both in terms of fitness and precision. Nevertheless, the discovery techniques perform better in the case of smaller data sets, with less complex process models. Typically, automated discovery techniques have to address scalability issues due to the high amount of data present in the logs. However, as demonstrated, the process discovery techniques can also encounter issues of opposite nature. While discovery techniques typically have to address scalability issues due to large datasets, in the case of companies with long delivery cycles, long processing times and parallel production, which is common for the industrial sector, they have to address issues with incompleteness and lack of information in datasets. The management of business companies is becoming essential for companies to stay competitive through efficiency. The issues encountered within the simulation model will be amplified through both vertical and horizontal integration of the supply chain within the Industry 4.0. The impact of vertical integration in the BPMN model and the chosen case identifier is demonstrated. Without the assumption of smart manufacturing, it would be impossible to use a single case identifier throughout the entire simulation. The entire process would have to be divided into several subprocesses.

scholarly journals Automated discovery of structured process models from event logs: The discover-and-structure approach

2018 ◽  
Vol 117 ◽  
pp. 373-392 ◽  
Author(s):  
Adriano Augusto ◽  
Raffaele Conforti ◽  
Marlon Dumas ◽  
Marcello La Rosa ◽  
Giorgio Bruno
Keyword(s):  
Process Models ◽  
Structure Approach ◽  
Event Logs ◽  
Automated Discovery

scholarly journals Improving the performance of process discovery algorithms by instance selection

2020 ◽  
Vol 17 (3) ◽  
pp. 927-958
Author(s):  
Mohammadreza Sani ◽  
Sebastiaan van Zelst ◽  
Aalst van der
Keyword(s):  
Process Model ◽  
Business Processes ◽  
Process Models ◽  
Instance Selection ◽  
Event Data ◽  
Process Discovery ◽  
Selection Strategies ◽  
Speed Up ◽  
The Right ◽  
Discovery Algorithms

Process discovery algorithms automatically discover process models based on event data that is captured during the execution of business processes. These algorithms tend to use all of the event data to discover a process model. When dealing with large event logs, it is no longer feasible using standard hardware in limited time. A straightforward approach to overcome this problem is to down-size the event data by means of sampling. However, little research has been conducted on selecting the right sample, given the available time and characteristics of event data. This paper evaluates various subset selection methods and evaluates their performance on real event data. The proposed methods have been implemented in both the ProM and the RapidProM platforms. Our experiments show that it is possible to considerably speed up discovery using instance selection strategies. Furthermore, results show that applying biased selection of the process instances compared to random sampling will result in simpler process models with higher quality.

scholarly journals Towards Aspects Identification in Business Process Through Process Mining

2015 ◽  
Author(s):  
Bruna Brandão ◽  
Flávia Santoro ◽  
Leonardo Azevedo
Keyword(s):  
Programming Languages ◽  
Business Process ◽  
Process Model ◽  
Process Mining ◽  
Process Models ◽  
Preliminary Evaluation ◽  
Crosscutting Concerns ◽  
Business Process Models ◽  
Event Logs ◽  
Initial Results

In business process models, elements can be scattered (repeated) within different processes, making it difficult to handle changes, analyze process for improvements, or check crosscutting impacts. These scattered elements are named as Aspects. Similar to the aspect-oriented paradigm in programming languages, in BPM, aspect handling has the goal to modularize the crosscutting concerns spread across the models. This process modularization facilitates the management of the process (reuse, maintenance and understanding). The current approaches for aspect identification are made manually; thus, resulting in the problem of subjectivity and lack of systematization. This paper proposes a method to automatically identify aspects in business process from its event logs. The method is based on mining techniques and it aims to solve the problem of the subjectivity identification made by specialists. The initial results from a preliminary evaluation showed evidences that the method identified correctly the aspects present in the process model.

Discovering Process Horizontal Boundaries to Facilitate Process Comprehension

2018 ◽  
Vol 9 (2) ◽  
pp. 1-31 ◽  
Author(s):  
Pavlos Delias ◽  
Kleanthi Lakiotaki
Keyword(s):  
Process Model ◽  
Process Mining ◽  
A Priori ◽  
Quality Criteria ◽  
Large Set ◽  
Process Discovery ◽  
Event Log ◽  
Human Interpretation ◽  
Automated Discovery ◽  
Priori Information

Automated discovery of a process model is a major task of Process Mining that means to produce a process model from an event log, without any a-priori information. However, when an event log contains a large number of distinct activities, process discovery can be real challenging. The goal of this article is to facilitate process discovery in such cases when a process is expected to contain a large set of unique activities. To this end, this article proposes a clustering approach that recommends horizontal boundaries for the process. The proposed approach ultimately partitions the event log in a way that human interpretation efforts are decomposed. In addition, it makes automated discovery more efficient as well as effective by simultaneously considering two quality criteria: informativeness and robustness of the derived groups of activities. The authors conducted several experiments to test the behavior of the algorithm under different settings, and to compare it against other techniques. Finally, they provide a set of recommendations that may help process analysts during the process discovery endeavor.

scholarly journals Split miner: automated discovery of accurate and simple business process models from event logs

2018 ◽  
Vol 59 (2) ◽  
pp. 251-284 ◽  
Author(s):  
Adriano Augusto ◽  
Raffaele Conforti ◽  
Marlon Dumas ◽  
Marcello La Rosa ◽  
Artem Polyvyanyy
Keyword(s):  
Business Process ◽  
Process Models ◽  
Business Process Models ◽  
Event Logs ◽  
Automated Discovery

scholarly journals A survey of graph-based algorithms for discovering business processes

2019 ◽  
Vol 5 (2) ◽  
pp. 137 ◽  
Author(s):  
Riyanarto Sarno ◽  
Kelly Rossa Sungkono
Keyword(s):  
Time Complexity ◽  
High Performance ◽  
Process Model ◽  
Business Processes ◽  
Performance Metrics ◽  
Graph Database ◽  
Process Discovery ◽  
Model Based ◽  
And Performance

Algorithms of process discovery help analysts to understand business processes and problems in a system by creating a process model based on a log of the system. There are existing algorithms of process discovery, namely graph-based. Of all algorithms, there are algorithms that process graph-database to depict a process model. Those algorithms claimed that those have less time complexity because of the graph-database ability to store relationships. This research analyses graph-based algorithms by measuring the time complexity and performance metrics and comparing them with a widely used algorithm, i.e. Alpha Miner and its expansion. Other than that, this research also gives outline explanations about graph-based algorithms and their focus issues. Based on the evaluations, the graph-based algorithm has high performance and less time complexity than Alpha Miner algorithm.

Sign in / Sign up

Export Citation Format

Share Document