Constructing Probabilistic Process Models based on Hidden Markov Models for Resource Allocation
|
|
- Verity Chambers
- 7 years ago
- Views:
Transcription
1 Constructing Probabilistic Process Models based on Hidden Markov Models for Resource Allocation Berny Carrera and Jae-Yoon Jung Dept. of Industrial and Management Systems Engineering, Kyung Hee University 1 Seochen-dong, Giheung-gu, Yongin, Gyeonggi, Republic of Korea {berny, jyjung}@khu.ac.kr Abstract. A Hidden Markov Model (HMM) is a temporal statistical model which is widely utilized for various applications such as gene prediction, speech recognition and localization prediction. HMM represents the state of the process in a discrete variable, where the values are the possible observations of the world. For the purpose of process mining for resource allocation, HMM can be applied to discover a probabilistic workflow model from activities and identify the observations based on the resources utilized by each activity. In this paper, we introduce a process discovery method that combines an organizational perspective with a probabilistic approach to address the resource allocation and improve the productivity of resource management, maximizing the likelihood of the model using the Expectation-Maximization procedure. Keywords: Probabilistic Process Discovery, Process Mining, Resource Allocation, Hidden Markov Models. 1 Introduction The basic idea of business process modeling is how enterprises can represent actual processes in the way that those processes can be analyzed and improved. Through this model, organizations can obtain a graphical representation of the process activities defining a workflow in order to reach and accomplish intended objectives of business processes [1]. Currently, existing process models do not consider a probabilistic analysis of resources. Consequently, this paper examines a probabilistic approach to resource allocation to represent the relationship between resources and their activities as well as analyze their transitions to indicate the importance of each resource in the related activity. Hence, based on the context of process mining and their perspectives [2], this study will emphasize a control-flow perspective combined with an organizational perspective to support resource allocation by constructing a stochastic model from an event log and reveal how the resources interact directly with the activities. Corresponding author.
2 Meanwhile, machine learning and process mining techniques are closely related [3]. Some machine learning algorithms operate as a black box but are helpful for creating systems that can learn from data through poor control-flow discovery. Some machine learning techniques [4] are statistically based on the way that they have learned from data and are concerned with the collection, analysis, and interpretation of data, making these techniques the heart of quantitative reasoning which is necessary for making decisions and recommendations in systems. Hence, HMM is a technique that can deal precisely with noise, incompleteness and not over-fitting the model unlike other techniques e.g. decision trees, support vector machines, ANOVA, etc. In general, HMM can be helpful in a specific form of the transition process and the process can be considered as a series of time slices. Basically, HMM is modeled after the process in different states for each activity, and the observations in HMM become the resources that interact with the activities. As a result, this research evaluates the possibility of discovering an extended probabilistic process model from a controlflow process with an organizational perspective by applying HMM for resource allocation, analyzing the resource attribute of each event and the activities flow, and estimating the parameters for each activity (state) and resource (observation). Therefore, this paper investigates the contribution of the applicability of HMM for process mining based on previous premises by defining a probabilistic model that is likely to explain the observed behavior that considers the control-flow patterns, resources, and organization structure. The remainder of the paper is organized as follows. First, the related work is discussed in more detail in Section 2. Section 3 introduces the event logs and HMM notations for the proposed model and explains HMM workflow discovery. Section 4 presents the estimation of the probabilities, resource allocation notations and applicability of the HMM Miner. Finally, Section 5 provides the conclusions and future work of the paper. 2 Related Work There are a few research approaches of HMM in process mining. Rozinat et al. [5] propose a method that begins with a petri-net in order to construct a HMM for a quality evaluation of the model, taking into account different metrics like fitness and precision. Da Silva and Ferreira [6] apply HMM in sequence clustering, where all the elements of the sequence are related with each state in the model as well as propose five different topologies for the model. In [7] and [8], the intension mining approach is proposed to identify the reasoning of processes that are behind of the activities. A number of previous studies have focused on resource and actions or reactions in the business process execution. Rozinat and van der Aalst [3] propose a decision mining technique based on case perspective analysis. Song and van der Aalst [10] present social mining that has an organizational perspective which monitors the originators and relationships and focuses on how the originators interact between them, though not directly with the activities. Recently, Kim et al. [11] introduced a performer recommendation using a decision tree which focuses on time and 2
3 organizational perspective, resulting in the length of the decision tree becoming too large and too difficult to analyze. The proposed approach based on the probabilistic method differs from the existing studies from two perspectives: the control-flow perspective proposing a model based on the order of activities, and organizational perspective analyzing and proposing the best interaction between the activities and resources. 3 HMM-based Process Mining 3.1 Resource-Oriented Event Log An event log is used as input of process mining to construct models that explain and interpret some aspect of the behavior stored. The event log contains traces referring to the number of cases, activities and resources, as shown in Table 1. It should be noted that this study has not taken into account time stamps or other types of data. Instead, the formal models presented by van der Aalst [12] are extended for HMM miner which adds a limitation based on an event log and a footprint matrix, and it is defined as a resource-oriented event log which follows: Definition 1. (Resource-Oriented Event Log) Let L be an event log. L is a tuple <C, S, V>, where C is the set of all possible cases, S of length is the finite set of event labels {,, } that has been performed over L, and of length M is a set of originators,, that specify the resource associated with the task. The construction of HMM workflow is explained in Sections 3.2 and 3.3. To calculate the initial parameters, the event log is needed to mine the frequency of the occurrence of the activities and resources. This is explained more in Section 4. Section 5 discusses how to find the maximum-likelihood estimation (MLE). Table 1. Example of process log. Case ID Activity 1,,, 2,,, 3,,, 4,,, 5,,, 6,, 3
4 3.2 HMM Miner Algorithm To accommodate the event log, process mining, and HMM in terms of resource allocation, the concepts of HMM workflow is introduced. The formal notation for the HMM workflow is as follows: Definition 2. (HMM Workflow) Let L be a resource-oriented event log. A HMM workflow,,, is represented by: s = {,,, } ϵ L where {,, } are the states or activities of L and { } a dummy end state. V = {,,, } ϵ L where { } are the observations of resources and { } a dummy observation of the dummy end state { }. Fs is an NxN matrix with footprint sequence and frequency of occurrence for transitions to. Fv is an NxM matrix with the frequency of occurrence for resources V in state. The procedure for constructing the HMM workflow is presented in Fig. 1. The HMM miner algorithm first investigates the control-flow perspective of a process model from an event log, and considers the order of the events within a case. The attributes such as case id, activity, and resource are utilized in the mining process. 1: Input: event log L 2: Initialize 3: Find all activities S and all resources V in the traces in L. 4: Find start activities and end activities from 5: Create a footprint matrix with frequencies from L 6: Create a frequency matrix from L 7: Add the corresponding state into the initial state set with its starting probability π. 8: Create dummy state = ε with an arc from ε to ε in S for refer the end of process 9: Create dummy observation = ε to denote the end resource for state ε. 10: All end activities given by, the corresponding states are end states; then create an arc from to ε and calculate each frequency. 11: For each pair (, ) in S 12: If in Fs has a direct follow then 13: Create an arc from to with its frequency ( ). 14: End For 15: For each pair (, ) in 16: If > 0 then 17: Create an arc from to with its frequency ( ). 18: End For 19: HMM workflow = (s, V, Fs, Fv) 20: Calculate probabilities for A in arcs and B for related activities of in each. 21: Output: initial HMM: λ = (N, M, A, B, π ) Fig. 1. HMM miner algorithm. 4
5 3.3 Mining Markovian States HMM workflow learns from the event log which is fully observed data where the states of the HMM can be represented based on the activities. It takes the notation of event logs to describe the example log in Table 1 where it observes the event sequences L = <abcd, abcd, abcd, acbd, acbd, aed>. In order to discover a process model, the event log has to be analyzed while it is mining the causal dependencies by using the footprint notation for HMM Miner, and, when analyzed, different patterns of the states evaluate the precedence of each activity, and the frequency of the observed sequences. In order to satisfy these requirements the footprint matrix is introduced in Definition 3. In process mining, α-algorithm [9] is considered one of the baseline techniques for analysis of patterns in event logs. In our approach, a footprint matrix is required to construct the state transitions of a HMM model analyzing the relations of a pair of activities. The footprint matrix is focused on a process perspective especially in analysis and differentiation of activities sequences. It can measure the frequency of activities and the sequences, helping to real situations where the data is not complete or has noise. Definition 3. (Footprint Matrix for HMM Miner) Let L be an event log. Let x 1, x 2 L: x 1 > L x 2 if and only if there is a trace σ = <t 1, t 2, t 3,, t n > and i {1,, n-1} such that σ L and t i = x 1 and t i+1 = x 2 (Contains all pairs of activities in a directly follows ). If is a directly follow, fs = x 1 L x 2 if and only if x 1 > L x 2 and x 2 > L x 1 (Contains all pairs of activities in a causality relation x 1 # L x 2 if and only if x 1 > L x 2 and x 2 > L x 1 x 1 L x 2 of and only if x 1 > L x 2 and x 2 > L x 1 Table 2. Footprint matrix Fs for event log in Table 1. a b c d e a #, 3, 2 #, 1 b #, 3, 2 # c, 2 #, 3 # d # # e # #, 1 # For our implementation activities x1, x2 xn, are the states for the HMM, e.g. a, b,, e. After constructing the footprint matrix, the next step is to start with the construction of a Markov chain that simulates a dependency graph based on the states of HMM. The HMM diagram has states expressed by oval shape and activity name, and transitions are represented by two different arcs, one for transition activities and other for the resource relationships. The first one represents the successor states and in terms of resource mining, the relationship between the activities, and the second, 5
6 the observations (resources) that correspond to that activity, e.g. activity a has a causality relation with activities b, c and e; so, it is creates a transition denoted by an arc from a to these activities. The initial states of the HMM workflow are denoted graphically by a double oval, and the probabilities of each initial state are assigned in the initial state distribution π. Fig. 2 shows that all observations were represented with a square shape and resource name and assigned directly to each state, and, in turn, the resources are mined from the event log and related to specific activity. To model the end of the process dummy state ε is added, which receives its input from the last activity in each sequence and from which no other state is reachable. Consequently, the transition probability from this state to itself should equal 1. Figure 2 describes a constructed HMM workflow and the interaction of the activities with the different resources show how after the state d is fired and reaches the state ε. The next section describes how to estimate the probabilities in the mode which first, calculates the initial values for the state transition probability distribution A and for the observation symbol probability distribution B. After several steps, it is determined that the expectation maximization for these probabilities obtains the estimated A* and B*. Fig. 2. HMM workflow constructed from the footprint matrix without probabilities of Table 2. 4 Resource Allocation with HMM Miner 4.1 Relating Resources to HMM After obtaining the mined structure of HMM, including the number of states (activities) N, name of the different states s, count of observations (resources) M, label of each observation V and the initial states defined in π, the next step is to determine the initial state transition probability distribution A and the observation symbol probability distribution B. To begin analyzing both probability distributions, the frequency f of each activity and resource, is needed and with them, the weight of the arcs can be calculated, and it is possible to decide which elements should be kept for analysis, and which elements can be discarded to reduce the noise of the mined event log. Starting with the transition probabilities, the footprint matrix is needed to obtain the frequencies. 6
7 In order to start the analysis to get the probabilities for the HMM workflow the assumption is made that the data is from an event log L = <C, S, V>; and each event in L is given by a tuple (s, v) and the total events in L is K. Then (s k, v k ) = (, ),...,(, ) the probabilities can be computed and collected :,. (1) P,,.,,.. (2) Note in this equation, it is taken in account the frequency where f(i) is the number of times i is the initial state in (s,v). In f(i,j) the number of times j follows i in (s,v) this frequency is in the footprint matrix Fs and f(v k ) the number of times i is paired with observation v is in matrix Fv. According to these HMM parameters, the log probability can be easily calculated:, Lλ P,. (3) Logλ log, log,,., (4) In order to find λ that give us a maximum value for L(λ) The following formula is needed: d Lλ/dλ 0 π. (5),,,. (6),. (7) Basically, a supervised learning from all mined activities and resources is taken, allowing for the calculation of the probability of each element independently. 4.2 Maximum Likelihood Estimation Knowing the initial values λ = (N, M, A, B, π); it would be possible to estimate the maximum likelihood in selecting the best values for the model parameters that make 7
8 the observed data the most probable and obtain λ*= (N, M, A*, B*, π*). As described in Fig. 3, EM procedure essentially calculates their values in 2 steps E and M can be calculated using forward and backward algorithms [4] for HMM. 1: Inputs: λ = ( N, M, A, B, π ) and event log L 2: Initialize 3: Repeat 4: Using forward algorithm calculate for each trace in L 5: Using backward algorithm calculate for each trace in L 6: Re-estimation of temporal variables 7: Calculate γ and ξ based on and 8: Calculate A*, B*, π* from the temporal variables 9: Updating λ 10: Until A and B do not change 11: Output: λ* = ( N, M, A*, B*, π* ) Fig. 3. Expectation-Maximization procedure. In order to improve λ, the EM procedure uses from the forward algorithm and from the backward algorithm, which utilizes the variables γ and ξ as temporal variables [4] in order to estimate the values of A*, B*, and π*.. (8) 1 ξ. (9) 1 Given an observation sequence, is the probability of being in state i at time t and ξ is the probability of being in state i at time t and being in state j at time t+1. These temporal variables are useful in order to determine the maximum likelihood of the parameters, can be interpreted like the possibility to be in a specific activity on a determined time of the process and ξ the probability of the following activities in a specified time.. (10) where is the expected initial state distribution at time 1 in state i. In other words, the expected probability is to begin the process in a specific activity. ξ. (11) where is the expected state transition probability distribution, and is the number of times that the transition i occurs in sequence from t=1 to T-1. Then, is the expected probability from being in activity i to j. 8
9 ;. (12) is the expected observation symbol probability distribution, where is the expected number of times in state j and observing symbol, divided by the expected number of times in j. In terms of this study, it is the predicted parameters of the resources assigned to a specified activity. 4.3 Example The example is based on the event log from Table 1. It is used for the mining algorithm in Fig. 1 in order to construct the HMM workflow. In Table 2, a footprint matrix is created and Fig. 2 shows the mined HMM workflow without the frequencies. From this point, the next step is calculate the frequency matrix Fv for the analysis of resources, and calculates the initial parameters explained in Section 4.1, and the values for the maximum likelihood explained in Section 4.2. First, the mined event log produces three different activity sequences and the algorithm estimate a percentage for <abcdε> with 0.5%, <acbdε> with 0.33% and <aedε> with 0.16%, the number of states that identifies each activity are N = 6 with s = {a, b, c, d, e, ε} and the number of resources that will be the observations M = 6 with V = {Pete, Mike, Ellen, Sue, Sean, ε}. Table 3. Frequency matrix Fv for event log in Table 1. Pete Mike Ellen Sue Sean ε a b c d e ε Table 3 shows the frequency of resources based on activities and is used to create the observation symbol probability distribution B = { }. The initial state distribution is 1,0,0,0,0,0, where activity {a} is the only one that starts all the process sequence. Table 4. State transition probability distribution A = {, } a b c d e ε a 0 3/6 2/6 0 1/6 0 b 0 0 3/5 2/5 0 0 c 0 2/5 0 3/5 0 0 d e ε
10 Table 5. Observation symbol probability distribution B = { } Pete Mike Ellen Sue Sean ε a 3/6 1/6 2/ b /5 1/5 0 c /5 3/5 0 d 2/6 3/6 1/ e ε Table 4 shows the probabilities for HMM workflow from equation 6 where it analyzes the transition from the state i corresponding to the current transition to all states j. For example to assign value probability from activity {a} to {b}, after {a} is fired {b, c, e} can be the next state, the total frequency of sequences {ab}, {ac} and {ae} are 6, and evaluating just {ab} the frequency is 3 showed in Table 2, the probability is 3/6. In the case of resources probabilities, Table 5 shows the observation probability distribution where it is analyzes the resources that interact with a specific activity. For example, in activity {a} the resources used are {Pete, Mike, Ellen} the total frequency is 6 and frequency observed for {Mike} is 1 showed in Table 3, then applying equation 7 the probability is 1/6. Table 6. Expected state transition probability distribution A* = { } a b c d e ε a b c d e ε With the initial values for the HMM workflow, the EM procedure is utilized to estimate the expected values for transition A* and observation B* distribution. Tables 6 and 7 are shown in graphical form in Fig. 3. Table 7. Expected observation symbol probability distribution B* = { } Pete Mike Ellen Sue Sean ε a b c d e ε
11 Fig. 4. Estimated HMM workflow constructed from the footprint matrix of Table 1. It should be noted that this study has been primarily concerned with the estimation of control flow probabilities and the analysis of work distributions between resources and activities. Our approach is helpful to answer related questions in resource allocation, such as: How to determine the experience of resources in a specific activity?, How to promote a resource effectively based on their experience? and What activity has to be scheduled and the resources required?. We plan to conduct related experiments in the near future in order to compare and evaluate the proposed method using real-life event logs and implement it in a ProM framework. 5 Conclusions This study presented designs a probabilistic discovery process from event log using HMM to support resource allocation. Specifically, the expectation maximization approach was adopted for estimating the model parameters. The proposed method is useful in real-world scenarios for managing standard errors and noise in real case event logs. Since determining the number of hidden states is very difficult, the following model was based on activities and resources in such a way that the comprehension of the model is enhanced. Also, the proposed technique is helpful to compare the performance of resources for activity executions. Future work includes the consideration of the time perspective to analyze if a resource is busy and the extension of the technique to other scenarios. Acknowledgments. This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (No. 2012R1A1B ). 11
12 References 1. Aguilar-Saven, R. S.: Business process modelling: Review and framework. Int. J. Prod. Econ., 90(2), (2004) 2. van der Aalst, W.M.P., Adriansyah, A., de Medeiros, A.K.A., Arcieri, F., Baier, T., Blickle, T., Pontieri, L. et al.: Process mining manifesto. In: Florian D., Kamel B., Schahram D. (eds.) BPM Workshop LNCS, vol. 99, pp Springer Berlin, Heidelberg (2012) 3. Rozinat, A., & van der Aalst, W.M.P.: Decision mining in ProM. In: Dustdar, S., Fiadeiro, J.L., Sheth, A. (eds.) BPM LNCS, vol. 4102, pp Springer, Heidelberg (2006) 4. Bishop, C.M.: Pattern recognition and machine learning. Springer, New York (2006) 5. Rozinat, A., Veloso, M., & van der Aalst, W.M.P.: Using hidden markov models to evaluate the quality of discovered process models. Extended Version. BPM Center Report BPM-08-10, BPMcenter.org (2008) 6. da Silva, G.A., & Ferreira, D.R.: Applying hidden Markov models to process mining. In Sistemas e Tecnologias de Informação. AISTI/FEUP/UPF (2009) 7. Khodabandelou, G.: Supervised intentional process models discovery using hidden markov models. RCIS 2013, 1(11). IEEE Press (2013) 8. Khodabandelou, G., Hug, C., Deneckère, R., & Salinesi, C.: Process mining versus intention mining. In: Nurcan, S., Proper, H.A., Soffer, P., Krogstie, J., Schmidt, R., Halpin, T., Bider, I. (eds.) BPMDS LNBIP, vol. 147, pp Springer Berlin, Heidelberg (2013) 9. van der Aalst, W.M.P., Weijters, T., & Maruster, L.: Workflow mining: Discovering process models from event logs. IEEE T. Knowl. Data En., 16(9) (2004) 10. Song, M., & van der Aalst, W.M.P.: Towards comprehensive support for organizational mining. Decis. Support. Syst., 46(1), (2008) 11. Kim, A., Obregon, J., & Jung, J.-Y.: Constructing decision trees from process logs for performer recommendation. BPM Workshops LNCS, vol. 171, pp Springer, Heidelberg (2014) 12. van der Aalst, W.M.P.: Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer, Heidelberg (2011) 12
Business Process Modeling
Business Process Concepts Process Mining Kelly Rosa Braghetto Instituto de Matemática e Estatística Universidade de São Paulo kellyrb@ime.usp.br January 30, 2009 1 / 41 Business Process Concepts Process
More informationAnalysis of Service Level Agreements using Process Mining techniques
Analysis of Service Level Agreements using Process Mining techniques CHRISTIAN MAGER University of Applied Sciences Wuerzburg-Schweinfurt Process Mining offers powerful methods to extract knowledge from
More informationProcess Modelling from Insurance Event Log
Process Modelling from Insurance Event Log P.V. Kumaraguru Research scholar, Dr.M.G.R Educational and Research Institute University Chennai- 600 095 India Dr. S.P. Rajagopalan Professor Emeritus, Dr. M.G.R
More informationProcess Mining. ^J Springer. Discovery, Conformance and Enhancement of Business Processes. Wil M.R van der Aalst Q UNIVERS1TAT.
Wil M.R van der Aalst Process Mining Discovery, Conformance and Enhancement of Business Processes Q UNIVERS1TAT m LIECHTENSTEIN Bibliothek ^J Springer Contents 1 Introduction I 1.1 Data Explosion I 1.2
More informationCombination of Process Mining and Simulation Techniques for Business Process Redesign: A Methodological Approach
Combination of Process Mining and Simulation Techniques for Business Process Redesign: A Methodological Approach Santiago Aguirre, Carlos Parra, and Jorge Alvarado Industrial Engineering Department, Pontificia
More informationImproving Business Process Models with Agent-based Simulation and Process Mining
Improving Business Process Models with Agent-based Simulation and Process Mining Fernando Szimanski 1, Célia G. Ralha 1, Gerd Wagner 2, and Diogo R. Ferreira 3 1 University of Brasília, Brazil fszimanski@gmail.com,
More informationProcess Mining in Big Data Scenario
Process Mining in Big Data Scenario Antonia Azzini, Ernesto Damiani SESAR Lab - Dipartimento di Informatica Università degli Studi di Milano, Italy antonia.azzini,ernesto.damiani@unimi.it Abstract. In
More informationCHAPTER 1 INTRODUCTION
CHAPTER 1 INTRODUCTION 1.1 Research Motivation In today s modern digital environment with or without our notice we are leaving our digital footprints in various data repositories through our daily activities,
More informationUSING PROCESS MINING FOR ITIL ASSESSMENT: A CASE STUDY WITH INCIDENT MANAGEMENT
USING PROCESS MINING FOR ITIL ASSESSMENT: A CASE STUDY WITH INCIDENT MANAGEMENT Diogo R. Ferreira 1,2, Miguel Mira da Silva 1,3 1 IST Technical University of Lisbon, Portugal 2 Organizational Engineering
More informationImplementing Heuristic Miner for Different Types of Event Logs
Implementing Heuristic Miner for Different Types of Event Logs Angelina Prima Kurniati 1, GunturPrabawa Kusuma 2, GedeAgungAry Wisudiawan 3 1,3 School of Compuing, Telkom University, Indonesia. 2 School
More informationEFFECTIVE CONSTRUCTIVE MODELS OF IMPLICIT SELECTION IN BUSINESS PROCESSES. Nataliya Golyan, Vera Golyan, Olga Kalynychenko
380 International Journal Information Theories and Applications, Vol. 18, Number 4, 2011 EFFECTIVE CONSTRUCTIVE MODELS OF IMPLICIT SELECTION IN BUSINESS PROCESSES Nataliya Golyan, Vera Golyan, Olga Kalynychenko
More informationDotted Chart and Control-Flow Analysis for a Loan Application Process
Dotted Chart and Control-Flow Analysis for a Loan Application Process Thomas Molka 1,2, Wasif Gilani 1 and Xiao-Jun Zeng 2 Business Intelligence Practice, SAP Research, Belfast, UK The University of Manchester,
More informationDiscovering User Communities in Large Event Logs
Discovering User Communities in Large Event Logs Diogo R. Ferreira, Cláudia Alves IST Technical University of Lisbon, Portugal {diogo.ferreira,claudia.alves}@ist.utl.pt Abstract. The organizational perspective
More informationDiscovering process models from empirical data
Discovering process models from empirical data Laura Măruşter (l.maruster@tm.tue.nl), Ton Weijters (a.j.m.m.weijters@tm.tue.nl) and Wil van der Aalst (w.m.p.aalst@tm.tue.nl) Eindhoven University of Technology,
More informationModel Discovery from Motor Claim Process Using Process Mining Technique
International Journal of Scientific and Research Publications, Volume 3, Issue 1, January 2013 1 Model Discovery from Motor Claim Process Using Process Mining Technique P.V.Kumaraguru *, Dr.S.P.Rajagopalan
More informationBPIC 2014: Insights from the Analysis of Rabobank Service Desk Processes
BPIC 2014: Insights from the Analysis of Rabobank Service Desk Processes Bruna Christina P. Brandão, Guilherme Neves Lopes, Pedro Henrique P. Richetti Department of Applied Informatics - Federal University
More informationPLG: a Framework for the Generation of Business Process Models and their Execution Logs
PLG: a Framework for the Generation of Business Process Models and their Execution Logs Andrea Burattin and Alessandro Sperduti Department of Pure and Applied Mathematics University of Padua, Italy {burattin,sperduti}@math.unipd.it
More informationBUsiness process mining, or process mining in a short
, July 2-4, 2014, London, U.K. A Process Mining Approach in Software Development and Testing Process: A Case Study Rabia Saylam, Ozgur Koray Sahingoz Abstract Process mining is a relatively new and emerging
More informationHow To Find The Model Of A Process From The Run Time
Discovering Process Models from Unlabelled Event Logs Diogo R. Ferreira 1 and Daniel Gillblad 2 1 IST Technical University of Lisbon 2 Swedish Institute of Computer Science (SICS) diogo.ferreira@ist.utl.pt,
More informationTowards Cross-Organizational Process Mining in Collections of Process Models and their Executions
Towards Cross-Organizational Process Mining in Collections of Process Models and their Executions J.C.A.M. Buijs, B.F. van Dongen, W.M.P. van der Aalst Department of Mathematics and Computer Science, Eindhoven
More informationDesigning and Evaluating an Interpretable Predictive Modeling Technique for Business Processes
Designing and Evaluating an Interpretable Predictive Modeling Technique for Business Processes Dominic Breuker 1, Patrick Delfmann 1, Martin Matzner 1 and Jörg Becker 1 1 Department for Information Systems,
More informationMercy Health System. St. Louis, MO. Process Mining of Clinical Workflows for Quality and Process Improvement
Mercy Health System St. Louis, MO Process Mining of Clinical Workflows for Quality and Process Improvement Paul Helmering, Executive Director, Enterprise Architecture Pete Harrison, Data Analyst, Mercy
More informationProcess Mining by Measuring Process Block Similarity
Process Mining by Measuring Process Block Similarity Joonsoo Bae, James Caverlee 2, Ling Liu 2, Bill Rouse 2, Hua Yan 2 Dept of Industrial & Sys Eng, Chonbuk National Univ, South Korea jsbae@chonbukackr
More informationHIERARCHICAL CLUSTERING OF BUSINESS PROCESS MODELS
International Journal of Innovative Computing, Information and Control ICIC International c 2009 ISSN 1349-4198 Volume 5, Number 12, December 2009 pp. 1 ISII08-123 HIERARCHICAL CLUSTERING OF BUSINESS PROCESS
More informationTowards a Software Framework for Automatic Business Process Redesign Marwa M.Essam 1, Selma Limam Mansar 2 1
ACEEE Int. J. on Communication, Vol. 02, No. 03, Nov 2011 Towards a Software Framework for Automatic Business Process Redesign Marwa M.Essam 1, Selma Limam Mansar 2 1 Faculty of Information and Computer
More informationTowards an Evaluation Framework for Process Mining Algorithms
Towards an Evaluation Framework for Process Mining Algorithms A. Rozinat, A.K. Alves de Medeiros, C.W. Günther, A.J.M.M. Weijters, and W.M.P. van der Aalst Eindhoven University of Technology P.O. Box 513,
More informationGeneration of a Set of Event Logs with Noise
Generation of a Set of Event Logs with Noise Ivan Shugurov International Laboratory of Process-Aware Information Systems National Research University Higher School of Economics 33 Kirpichnaya Str., Moscow,
More informationB. Majeed British Telecom, Computational Intelligence Group, Ipswich, UK
The current issue and full text archive of this journal is available at wwwemeraldinsightcom/1463-7154htm A review of business process mining: state-of-the-art and future trends A Tiwari and CJ Turner
More informationArticle. Abstract. This is a pre-print version. For the printed version please refer to www.wisu.de
Article StB Prof. Dr. Nick Gehrke Nordakademie Chair for Information Systems Köllner Chaussee 11 D-25337 Elmshorn nick.gehrke@nordakademie.de Michael Werner, Dipl.-Wirt.-Inf. University of Hamburg Chair
More informationA Research Article on Data Mining in Addition to Process Mining: Similarities and Dissimilarities
A Research Article on Data Mining in Addition to Process Mining: Similarities and Dissimilarities S. Sowjanya Chintalapati 1, Ch.G.V.N.Prasad 2, J. Sowjanya 3, R.Vineela 4 1, 3, 4 Assistant Professor,
More informationMerging Event Logs with Many to Many Relationships
Merging vent Logs with Many to Many Relationships Lihi Raichelson and Pnina Soffer Department of Information Systems, University of Haifa, Haifa 31905, Israel LihiRaOs@gmail.com, Spnina@is.haifa.ac.il
More informationSupervised vs. Unsupervised Learning for Intentional Process Model Discovery
Supervised vs. Unsupervised Learning for Intentional Process Model Discovery Ghazaleh Khodabandelou, Charlotte Hug, Rebecca Deneckere, Camille Salinesi To cite this version: Ghazaleh Khodabandelou, Charlotte
More informationInvestigating Clinical Care Pathways Correlated with Outcomes
Investigating Clinical Care Pathways Correlated with Outcomes Geetika T. Lakshmanan, Szabolcs Rozsnyai, Fei Wang IBM T. J. Watson Research Center, NY, USA August 2013 Outline Care Pathways Typical Challenges
More informationProM 6 Tutorial. H.M.W. (Eric) Verbeek mailto:h.m.w.verbeek@tue.nl R. P. Jagadeesh Chandra Bose mailto:j.c.b.rantham.prabhakara@tue.
ProM 6 Tutorial H.M.W. (Eric) Verbeek mailto:h.m.w.verbeek@tue.nl R. P. Jagadeesh Chandra Bose mailto:j.c.b.rantham.prabhakara@tue.nl August 2010 1 Introduction This document shows how to use ProM 6 to
More informationHandling Big(ger) Logs: Connecting ProM 6 to Apache Hadoop
Handling Big(ger) Logs: Connecting ProM 6 to Apache Hadoop Sergio Hernández 1, S.J. van Zelst 2, Joaquín Ezpeleta 1, and Wil M.P. van der Aalst 2 1 Department of Computer Science and Systems Engineering
More informationEMiT: A process mining tool
EMiT: A process mining tool B.F. van Dongen and W.M.P. van der Aalst Department of Technology Management, Eindhoven University of Technology P.O. Box 513, NL-5600 MB, Eindhoven, The Netherlands. b.f.v.dongen@tue.nl
More informationDecision Mining in Business Processes
Decision Mining in Business Processes A. Rozinat and W.M.P. van der Aalst Department of Technology Management, Eindhoven University of Technology P.O. Box 513, NL-5600 MB, Eindhoven, The Netherlands {a.rozinat,w.m.p.v.d.aalst}@tm.tue.nl
More informationProcess Mining and Visual Analytics: Breathing Life into Business Process Models
Process Mining and Visual Analytics: Breathing Life into Business Process Models Wil M.P. van der Aalst 1, Massimiliano de Leoni 1, and Arthur H.M. ter Hofstede 1,2 1 Eindhoven University of Technology,
More informationApproaching Process Mining with Sequence Clustering: Experiments and Findings
Approaching Process Mining with Sequence Clustering: Experiments and Findings Diogo Ferreira 1,3, Marielba Zacarias 2,3, Miguel Malheiros 3, Pedro Ferreira 3 1 IST Technical University of Lisbon, Taguspark,
More informationDiscovering Structured Event Logs from Unstructured Audit Trails for Workflow Mining
Discovering Structured Event Logs from Unstructured Audit Trails for Workflow Mining Liqiang Geng 1, Scott Buffett 1, Bruce Hamilton 1, Xin Wang 2, Larry Korba 1, Hongyu Liu 1, and Yunli Wang 1 1 IIT,
More informationBusiness Intelligence and Process Modelling
Business Intelligence and Process Modelling F.W. Takes Universiteit Leiden Lecture 7: Network Analytics & Process Modelling Introduction BIPM Lecture 7: Network Analytics & Process Modelling Introduction
More informationProcess Mining Online Assessment Data
Process Mining Online Assessment Data Mykola Pechenizkiy, Nikola Trčka, Ekaterina Vasilyeva, Wil van der Aalst, Paul De Bra {m.pechenizkiy, e.vasilyeva, n.trcka, w.m.p.v.d.aalst}@tue.nl, debra@win.tue.nl
More informationError Log Processing for Accurate Failure Prediction. Humboldt-Universität zu Berlin
Error Log Processing for Accurate Failure Prediction Felix Salfner ICSI Berkeley Steffen Tschirpke Humboldt-Universität zu Berlin Introduction Context of work: Error-based online failure prediction: error
More informationBusiness Process Mining: From Theory to Practice
Abstract Business Process Mining: From Theory to Practice C.J. Turner, A. Tiwari, R. A. Olaiya and Y, Xu Purpose - This paper presents a comparison of a number of business process mining tools currently
More informationOn Global Completeness of Event Logs
On Global Completeness of Event Logs Hedong Yang 1, Arthur HM ter Hofstede 2,3, B.F. van Dongen 3, Moe T. Wynn 2, and Jianmin Wang 1 1 Tsinghua University, Beijing, China, 10084 yanghd06@mails.tsinghua.edu.cn,jimwang@tsinghua.edu.cn
More informationProcess Mining and Monitoring Processes and Services: Workshop Report
Process Mining and Monitoring Processes and Services: Workshop Report Wil van der Aalst (editor) Eindhoven University of Technology, P.O.Box 513, NL-5600 MB, Eindhoven, The Netherlands. w.m.p.v.d.aalst@tm.tue.nl
More informationRabobank: Incident and change process analysis
Rabobank: Incident and change process analysis Michael Arias 1, Mauricio Arriagada 1, Eric Rojas 1, Cecilia Sant-Pierre 1, Marcos Sepúlveda 1 1 Pontificia Universidad Católica de Chile, Av. Vicuña Mackenna
More informationFeature. Applications of Business Process Analytics and Mining for Internal Control. World
Feature Filip Caron is a doctoral researcher in the Department of Decision Sciences and Information Management, Information Systems Group, at the Katholieke Universiteit Leuven (Flanders, Belgium). Jan
More informationMaster Thesis September 2010 ALGORITHMS FOR PROCESS CONFORMANCE AND PROCESS REFINEMENT
Master in Computing Llenguatges i Sistemes Informàtics Master Thesis September 2010 ALGORITHMS FOR PROCESS CONFORMANCE AND PROCESS REFINEMENT Student: Advisor/Director: Jorge Muñoz-Gama Josep Carmona Vargas
More informationModelling Workflow with Petri Nets. CA4 BPM PetriNets
Modelling Workflow with Petri Nets 1 Workflow Management Issues Georgakopoulos,Hornick, Sheth Process Workflow specification Workflow Implementation =workflow application Business Process Modelling/ Reengineering
More informationTrace Clustering in Process Mining
Trace Clustering in Process Mining M. Song, C.W. Günther, and W.M.P. van der Aalst Eindhoven University of Technology P.O.Box 513, NL-5600 MB, Eindhoven, The Netherlands. {m.s.song,c.w.gunther,w.m.p.v.d.aalst}@tue.nl
More informationProcess Mining: Making Knowledge Discovery Process Centric
Process Mining: Making Knowledge Discovery Process Centric Wil van der alst Department of Mathematics and Computer Science Eindhoven University of Technology PO Box 513, 5600 MB, Eindhoven, The Netherlands
More informationHardware Implementation of Probabilistic State Machine for Word Recognition
IJECT Vo l. 4, Is s u e Sp l - 5, Ju l y - Se p t 2013 ISSN : 2230-7109 (Online) ISSN : 2230-9543 (Print) Hardware Implementation of Probabilistic State Machine for Word Recognition 1 Soorya Asokan, 2
More informationSeparating Compliance Management and Business Process Management
Separating Compliance Management and Business Process Management Elham Ramezani 1, Dirk Fahland 2, Jan Martijn van der Werf 2, and Peter Mattheis 1 1 Hochschule Furtwangen, Germany (ramezani Peter.Mattheis)@hs-furtwangen.de
More informationApplication of Hidden Markov Model in Credit Card Fraud Detection
Application of Hidden Markov Model in Credit Card Fraud Detection V. Bhusari 1, S. Patil 1 1 Department of Computer Technology, College of Engineering, Bharati Vidyapeeth, Pune, India, 400011 Email: vrunda1234@gmail.com
More informationRelational XES: Data Management for Process Mining
Relational XES: Data Management for Process Mining B.F. van Dongen and Sh. Shabani Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands. B.F.v.Dongen, S.Shabaninejad@tue.nl
More informationSummary and Outlook. Business Process Intelligence Course Lecture 8. prof.dr.ir. Wil van der Aalst. www.processmining.org
Business Process Intelligence Course Lecture 8 Summary and Outlook prof.dr.ir. Wil van der Aalst www.processmining.org Overview Chapter 1 Introduction Part I: Preliminaries Chapter 2 Process Modeling and
More informationUsing Process Mining to Bridge the Gap between BI and BPM
Using Process Mining to Bridge the Gap between BI and BPM Wil van der alst Eindhoven University of Technology, The Netherlands Process mining techniques enable process-centric analytics through automated
More informationStatistical Machine Translation: IBM Models 1 and 2
Statistical Machine Translation: IBM Models 1 and 2 Michael Collins 1 Introduction The next few lectures of the course will be focused on machine translation, and in particular on statistical machine translation
More informationEventifier: Extracting Process Execution Logs from Operational Databases
Eventifier: Extracting Process Execution Logs from Operational Databases Carlos Rodríguez 1, Robert Engel 2, Galena Kostoska 1, Florian Daniel 1, Fabio Casati 1, and Marco Aimar 3 1 University of Trento,
More informationConformance Checking of Interacting Processes With Overlapping Instances
Conformance Checking of Interacting Processes With Overlapping Instances Dirk Fahland, Massimiliano de Leoni, Boudewijn F. van Dongen, and Wil M.P. van der Aalst Eindhoven University of Technology, The
More informationConfiguring IBM WebSphere Monitor for Process Mining
Configuring IBM WebSphere Monitor for Process Mining H.M.W. Verbeek and W.M.P. van der Aalst Technische Universiteit Eindhoven Department of Mathematics and Computer Science P.O. Box 513, 5600 MB Eindhoven,
More informationStructural Detection of Deadlocks in Business Process Models
Structural Detection of Deadlocks in Business Process Models Ahmed Awad and Frank Puhlmann Business Process Technology Group Hasso Plattner Institut University of Potsdam, Germany (ahmed.awad,frank.puhlmann)@hpi.uni-potsdam.de
More informationNew Ensemble Combination Scheme
New Ensemble Combination Scheme Namhyoung Kim, Youngdoo Son, and Jaewook Lee, Member, IEEE Abstract Recently many statistical learning techniques are successfully developed and used in several areas However,
More informationReplaying History. prof.dr.ir. Wil van der Aalst www.processmining.org
Replaying History prof.dr.ir. Wil van der Aalst www.processmining.org Growth of data PAGE 1 Process Mining: Linking events to models PAGE 2 Where did we apply process mining? Municipalities (e.g., Alkmaar,
More informationThe ProM framework: A new era in process mining tool support
The ProM framework: A new era in process mining tool support B.F. van Dongen, A.K.A. de Medeiros, H.M.W. Verbeek, A.J.M.M. Weijters, and W.M.P. van der Aalst Department of Technology Management, Eindhoven
More informationGenetic Process Mining: An Experimental Evaluation
Genetic Process Mining: An Experimental Evaluation A.K. Alves de Medeiros, A.J.M.M. Weijters and W.M.P. van der Aalst Department of Technology Management, Eindhoven University of Technology P.O. Box 513,
More informationProcess Mining Using BPMN: Relating Event Logs and Process Models
Noname manuscript No. (will be inserted by the editor) Process Mining Using BPMN: Relating Event Logs and Process Models Anna A. Kalenkova W. M. P. van der Aalst Irina A. Lomazova Vladimir A. Rubin Received:
More informationComparative Analysis of EM Clustering Algorithm and Density Based Clustering Algorithm Using WEKA tool.
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 9, Issue 8 (January 2014), PP. 19-24 Comparative Analysis of EM Clustering Algorithm
More informationProcess Mining-based Understanding and Analysis of Volvo IT s Incident and Problem Management Processes The BPI Challenge 2013
Process Mining-based Understanding and Analysis of Volvo IT s Incident and Problem Management Processes The BPI Challenge 2013 Chang Jae Kang 2, Young Sik Kang *,1, Yeong Shin Lee 1, Seonkyu Noh, Hyeong
More informationProM 6 Exercises. J.C.A.M. (Joos) Buijs and J.J.C.L. (Jan) Vogelaar {j.c.a.m.buijs,j.j.c.l.vogelaar}@tue.nl. August 2010
ProM 6 Exercises J.C.A.M. (Joos) Buijs and J.J.C.L. (Jan) Vogelaar {j.c.a.m.buijs,j.j.c.l.vogelaar}@tue.nl August 2010 The exercises provided in this section are meant to become more familiar with ProM
More informationMining Configurable Process Models from Collections of Event Logs
Mining Configurable Models from Collections of Event Logs J.C.A.M. Buijs, B.F. van Dongen, and W.M.P. van der Aalst Eindhoven University of Technology, The Netherlands {j.c.a.m.buijs,b.f.v.dongen,w.m.p.v.d.aalst}@tue.nl
More informationOverview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series
Sequences and Series Overview Number of instruction days: 4 6 (1 day = 53 minutes) Content to Be Learned Write arithmetic and geometric sequences both recursively and with an explicit formula, use them
More informationChange Propagation in Process Models using Behavioural Profiles
Change Propagation in Process Models using Behavioural Profiles Matthias Weidlich, Mathias Weske Hasso-Plattner-Institute, Potsdam, Germany Email: {matthias.weidlich,weske}@hpi.uni-potsdam.de Jan Mendling
More informationUsing Semantic Lifting for improving Process Mining: a Data Loss Prevention System case study
Using Semantic Lifting for improving Process Mining: a Data Loss Prevention System case study Antonia Azzini, Chiara Braghin, Ernesto Damiani, Francesco Zavatarelli Dipartimento di Informatica Università
More informationManaging and Tracing the Traversal of Process Clouds with Templates, Agendas and Artifacts
Managing and Tracing the Traversal of Process Clouds with Templates, Agendas and Artifacts Marian Benner, Matthias Book, Tobias Brückmann, Volker Gruhn, Thomas Richter, Sema Seyhan paluno The Ruhr Institute
More informationModeling and Analysis of Incoming Raw Materials Business Process: A Process Mining Approach
Modeling and Analysis of Incoming Raw Materials Business Process: A Process Mining Approach Mahendrawathi Er*, Hanim Maria Astuti, Dita Pramitasari Information Systems Department, Faculty of Information
More informationData Science. Research Theme: Process Mining
Data Science Research Theme: Process Mining Process mining is a relatively young research discipline that sits between computational intelligence and data mining on the one hand and process modeling and
More informationChapter 4: Architecture for Performance Monitoring of Complex Information Technology (IT) Infrastructures using Petri Net
Chapter 4: Architecture for Performance Monitoring of Complex Information Technology (IT) Infrastructures using Petri Net This chapter will focus on the various approaches that we have taken in the modeling
More informationA Goal-based approach for business process learning
A Goal-based approach for business process learning Johny Ghattas 1. Pnina Soffer 1, Mor Peleg 1 1 Department of Management information systems, University of Haifa, 31905, Haifa, Israel. {GhattasJohny@gmail.com,
More informationThe Basics of Graphical Models
The Basics of Graphical Models David M. Blei Columbia University October 3, 2015 Introduction These notes follow Chapter 2 of An Introduction to Probabilistic Graphical Models by Michael Jordan. Many figures
More informationFrom Workflow Design Patterns to Logical Specifications
AUTOMATYKA/ AUTOMATICS 2013 Vol. 17 No. 1 http://dx.doi.org/10.7494/automat.2013.17.1.59 Rados³aw Klimek* From Workflow Design Patterns to Logical Specifications 1. Introduction Formal methods in software
More informationProcess Mining and Network Analysis
Towards Comprehensive Support for Organizational Mining Minseok Song and Wil M.P. van der Aalst Eindhoven University of Technology P.O.Box 513, NL-5600 MB, Eindhoven, The Netherlands. {m.s.song, w.m.p.v.d.aalst}@tue.nl
More informationActivity Mining for Discovering Software Process Models
Activity Mining for Discovering Software Process Models Ekkart Kindler, Vladimir Rubin, Wilhelm Schäfer Software Engineering Group, University of Paderborn, Germany [kindler, vroubine, wilhelm]@uni-paderborn.de
More informationProcess Mining and Fraud Detection
Process Mining and Fraud Detection A case study on the theoretical and practical value of using process mining for the detection of fraudulent behavior in the procurement process Masters of Science Thesis
More informationCustomer Classification And Prediction Based On Data Mining Technique
Customer Classification And Prediction Based On Data Mining Technique Ms. Neethu Baby 1, Mrs. Priyanka L.T 2 1 M.E CSE, Sri Shakthi Institute of Engineering and Technology, Coimbatore 2 Assistant Professor
More informationWoPeD - An Educational Tool for Workflow Nets
WoPeD - An Educational Tool for Workflow Nets Thomas Freytag, Cooperative State University (DHBW) Karlsruhe, Germany freytag@dhbw-karlsruhe.de Martin Sänger, 1&1 Internet AG, Karlsruhe, Germany m.saenger09@web.de
More informationBPM-in-the-Large - Towards a higher level of abstraction in Business Process Management
BPM-in-the-Large - Towards a higher level of abstraction in Business Process Management Constantin Houy, Peter Fettke, Peter Loos, Wil M. P. Aalst, John Krogstie To cite this version: Constantin Houy,
More informationAnalyzing a TCP/IP-Protocol with Process Mining Techniques
Analyzing a TCP/IP-Protocol with Process Mining Techniques Christian Wakup 1 and Jörg Desel 2 1 rubecon information technologies GmbH, Germany 2 Fakultät für Mathematik und Informatik, FernUniversität
More informationDiagram Models in Continuous Business Process Improvement
JOURNAL OF APPLIED COMPUTER SCIENCE Vol. 22 No. 2 (2014), pp. 118-133 Diagram Models in Continuous Business Process Improvement Mateusz Wibig 1 1 CGI Polska Energy and Resources 39 Sienna Street, Warszawa
More informationProcess Mining A Comparative Study
International Journal of Advanced Research in Computer Communication Engineering Process Mining A Comparative Study Asst. Prof. Esmita.P. Gupta M.E. Student, Department of Information Technology, VIT,
More informationCombining business process and data discovery techniques for analyzing and improving integrated care pathways
Combining business process and data discovery techniques for analyzing and improving integrated care pathways Jonas Poelmans 1, Guido Dedene 1,4, Gerda Verheyden 5, Herman Van der Mussele 5, Stijn Viaene
More informationFacilitating Business Process Discovery using Email Analysis
Facilitating Business Process Discovery using Email Analysis Matin Mavaddat Matin.Mavaddat@live.uwe.ac.uk Stewart Green Stewart.Green Ian Beeson Ian.Beeson Jin Sa Jin.Sa Abstract Extracting business process
More informationCS 2750 Machine Learning. Lecture 1. Machine Learning. http://www.cs.pitt.edu/~milos/courses/cs2750/ CS 2750 Machine Learning.
Lecture Machine Learning Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square, x5 http://www.cs.pitt.edu/~milos/courses/cs75/ Administration Instructor: Milos Hauskrecht milos@cs.pitt.edu 539 Sennott
More informationProcess Aware Host-based Intrusion Detection Model
Process Aware Host-based Intrusion Detection Model Hanieh Jalali 1, Ahmad Baraani 1 1 University of Isfahan, Computer Department, Isfahan, Iran {jalali, ahmadb}@eng.ui.ac.ir 117 Abstract: Nowadays, many
More informationA Software Framework for Risk-Aware Business Process Management
A Software Framework for Risk-Aware Business Management Raffaele Conforti 1, Marcello La Rosa 1,2, Arthur H.M. ter Hofstede 1,4, Giancarlo Fortino 3, Massimiliano de Leoni 4, Wil M.P. van der Aalst 4,1,
More informationLearning Business Rules for Adaptive Process Models
Learning Business Rules for Adaptive Process Models Hans Friedrich Witschel, Tuan Q. Nguyen, Knut Hinkelmann Fachhochschule Nordwestschweiz FHNW Olten, Switzerland hansfriedrich.witschel@fhnw.ch, nguyen.quoctuan@students.fhnw.ch,
More informationBusiness Process Quality Metrics: Log-based Complexity of Workflow Patterns
Business Process Quality Metrics: Log-based Complexity of Workflow Patterns Jorge Cardoso Department of Mathematics and Engineering, University of Madeira, Funchal, Portugal jcardoso@uma.pt Abstract. We
More informationDiscovering Queues from Event Logs with Varying Levels of Information
Discovering Queues from Event Logs with Varying Levels of Information Arik Senderovich 2, Sander J.J. Leemans 1, Shahar Harel 2, Avigdor Gal 2, Avishai Mandelbaum 2, and Wil M.P. van der Aalst 1 1 Eindhoven
More informationProM Framework Tutorial
ProM Framework Tutorial Authors: Ana Karla Alves de Medeiros (a.k.medeiros@.tue.nl) A.J.M.M. (Ton) Weijters (a.j.m.m.weijters@tue.nl) Technische Universiteit Eindhoven Eindhoven, The Netherlands February
More information