Decision Mining in Prom A. Rozinat and W.M.P. van der Aalst Joosung, Ko.

Slides:



Advertisements
Similar presentations
Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, California
Advertisements

From Local Patterns to Global Models: Towards Domain Driven Educational Process Mining Nikola Trčka Mykola Pechenizkiy.
Jorge Muñoz-Gama Josep Carmona
Introduction to Computer Science 2 Lecture 7: Extended binary trees
A university for the world real R © 2009, Chapter 3 Advanced Synchronization Moe Wynn Wil van der Aalst Arthur ter Hofstede.
Han-na Yang Trace Clustering in Process Mining M. Song, C.W. Gunther, and W.M.P. van der Aalst.
Data Mining Techniques: Classification. Classification What is Classification? –Classifying tuples in a database –In training set E each tuple consists.
Decision Tree Approach in Data Mining
Alternative Approach to Systems Analysis Structured analysis
Best-First Search: Agendas
Decision Tree Learning 主講人:虞台文 大同大學資工所 智慧型多媒體研究室.
Aligning Event Logs and Process Models for Multi- perspective Conformance Checking: An Approach Based on ILP Massimiliano de Leoni Wil M. P. van der Aalst.
Models vs. Reality dr.ir. B.F. van Dongen Assistant Professor Eindhoven University of Technology
Chapter 12: Expert Systems Design Examples
A Survey of Process Mining in ProM By Jantima Polpinij Decision Systems Lab (DSL) Seminar School of Computer Science and Software Engineering Faculty of.
/faculteit technologie management Genetic Process Mining Ana Karla Medeiros Ton Weijters Wil van der Aalst Eindhoven University of Technology Department.
Application of Coloured Petri Net for Agent Control and Communication in the ABAsim Architecture Antonín Kavička University of Pardubice, Czech Republic.
1 Analysis of workflows a-priori and a-posteriori analysis Wil van der Aalst Eindhoven University of Technology Faculty of Technology Management Department.
Creating Architectural Descriptions. Outline Standardizing architectural descriptions: The IEEE has published, “Recommended Practice for Architectural.
Discovering Coordination Patterns using Process Mining Prof.dr.ir. Wil van der Aalst Eindhoven University of Technology Department of Information and Technology.
/faculteit technologie management 1 Process Mining: Extension Mining Algorithms Ana Karla Alves de Medeiros Ana Karla Alves de Medeiros Eindhoven University.
Business Intelligence
Data Mining and Decision Tree CS157B Spring 2006 Masumi Shimoda.
The Inductive Software Engineering Manifesto Principles for Industrial Data Mining Paper Authored By: Menzies & Kocaganeli – Lane Dept of CS/EE, WVU Bird,
A university for the world real R © 2009, Chapter 17 Process Mining and Simulation Moe Wynn Anne Rozinat Wil van der Aalst Arthur.
A university for the world real R © 2009, Chapter 23 Epilogue Wil van der Aalst Michael Adams Arthur ter Hofstede Nick Russell.
Insuring Sensitive Processes through Process Mining Jorge Munoz-Gama Isao Echizen Jorge Munoz-Gama and Isao Echizen.
Scientific Workflows Within the Process Mining Domain Martina Caccavale 17 April 2014.
Data Mining Chun-Hung Chou
Issues with Data Mining
Copyright R. Weber Machine Learning, Data Mining ISYS370 Dr. R. Weber.
Artificial Intelligence Lecture 9. Outline Search in State Space State Space Graphs Decision Trees Backtracking in Decision Trees.
Slides for “Data Mining” by I. H. Witten and E. Frank.
Mohammad Ali Keyvanrad
Jorge Muñoz-Gama Universitat Politècnica de Catalunya (Barcelona, Spain) Algorithms for Process Conformance and Process Refinement.
Decision Trees & the Iterative Dichotomiser 3 (ID3) Algorithm David Ramos CS 157B, Section 1 May 4, 2006.
EVENT-BASED REAL-TIME DECOMPOSED CONFORMANCE ANALYSIS Seppe vanden Broucke, Jorge Munoz-Gama, Josep Carmona, Bart Baesens, and Jan Vanthienen CoopIS 2014.
LEARNING DECISION TREES Yılmaz KILIÇASLAN. Definition - I Decision tree induction is one of the simplest, and yet most successful forms of learning algorithm.
Data Mining: Classification & Predication Hosam Al-Samarraie, PhD. Centre for Instructional Technology & Multimedia Universiti Sains Malaysia.
1 Knowledge Discovery Transparencies prepared by Ho Tu Bao [JAIST] ITCS 6162.
 Fundamentally, data mining is about processing data and identifying patterns and trends in that information so that you can decide or judge.  Data.
Jianmin Wang 1, Shaoxu Song 1, Xiaochen Zhu 1, Xuemin Lin 2 1 Tsinghua University, China 2 University of New South Wales, Australia 1/23 VLDB 2013.
CS690L Data Mining: Classification
Han-na Yang Rediscovering Workflow Models from Event-Based Data using Little Thumb.
C. Lawrence Zitnick Microsoft Research, Redmond Devi Parikh Virginia Tech Bringing Semantics Into Focus Using Visual.
Process-oriented System Analysis Process Mining. BPM Lifecycle.
Decision Trees Binary output – easily extendible to multiple output classes. Takes a set of attributes for a given situation or object and outputs a yes/no.
Decomposing Data-aware Conformance Checking Massimiliano de Leoni, Jorge Munoz-Gama, Josep Carmona, Wil van der Aalst PAGE 0.
Some Thoughts to Consider 8 How difficult is it to get a group of people, or a group of companies, or a group of nations to agree on a particular ontology?
Decision Tree Learning Presented by Ping Zhang Nov. 26th, 2007.
Decomposing Replay Problems: A Case Study Eric Verbeek and Wil van der Aalst.
Data Mining By Farzana Forhad CS 157B. Agenda Decision Tree and ID3 Rough Set Theory Clustering.
DECISION TREES Asher Moody, CS 157B. Overview  Definition  Motivation  Algorithms  ID3  Example  Entropy  Information Gain  Applications  Conclusion.
Outline Decision tree representation ID3 learning algorithm Entropy, Information gain Issues in decision tree learning 2.
1 By: Ashmi Banerjee (125186) Suman Datta ( ) CSE- 3rd year.
Maikel Leemans Wil M.P. van der Aalst. Process Mining in Software Systems 2 System under Study (SUS) Functional perspective Focus: User requests Functional.
Chapter 3 Data Mining: Classification & Association Chapter 4 in the text box Section: 4.3 (4.3.1),
CSE343/543 Machine Learning: Lecture 4.  Chapter 3: Decision Trees  Weekly assignment:  There are lot of applications and systems using machine learning.
Process Mining – Concepts and Algorithms Review of literature on process mining techniques for event log data.
Visualization in Process Mining
Multi-phase Process Mining: Building Instance Graphs
Profiling based unstructured process logs
CO Games Development 2 Week 22 Trees
Exploring processes and deviations
David Redlich, Thomas Molka, Wasif Gilani, Awais Rashid, Gordon Blair
Patterns extraction from process executions
A General Framework for Correlating Business Process Characteristics
Towards a Generic On Line Auditing Tool (OLAT)
CSCI N317 Computation for Scientific Applications Unit Weka
Haskell Tips You can turn any function that takes two inputs into an infix operator: mod 7 3 is the same as 7 `mod` 3 takeWhile returns all initial.
Presentation transcript:

Decision Mining in Prom A. Rozinat and W.M.P. van der Aalst Joosung, Ko

Outline Introduction Running Example Using Decision Trees for Analyzing Choices in Business Process Challenge for Decision Mining in Business Process Decision Mining with the ProM Framework

Introduction Some process mining techniques can be used for Process discovery and Conformance checking. We explore the potential of techniques in order to gain insight into the data perspective of business processes. The process mining algorithm identifies decision points The decision point is concerned with the choice between a Timeout activity and a Process answer activity. The application of data mining techniques has the potential to gain knowledge. Decision Miner offers a wide range of tools related to process mining and process analysis

only use the first two columns to obtain some process model. the result of applying the α- algorithm to the event log of some survey process

Running Example

Using Decision Trees for Analyzing Choices in Business Processes ➡ We need to identify decision points in order to analyze the choices in a business process. Identifying Decision Points in a Process Model - In a Petri net, a decision point corresponds to a place with multiple outgoing arcs. - The set of possible decisions must be described with respect to the event log. - A decision can be detected if the execution of the activity has been observed. - A process instance contains the given ‘footprint’ There was a decision for the associated alternative path in the process - It is sufficient to consider the occurrence of the first activity per alternative branch in order to classify the possible decisions.

Turning a Decision Point into a Learning Problem - Concept Description : the structural pattern inferred for such a classification problem. - To convert every decision point into a classification problem, whereas the classes are the different decision that can be made. - All attributes that have been written before the considered choice construct may be relevant for the routing of a case at that point.

Turning a Decision Point into a Learning Problem - In order to solve such a classification problem, there are various algorithms available. - Decision Tree : most popular of inductive inference algorithms, and provide a number of extensions. - There are effective methods to avoid overfitting the data. - A decision tree classifies instances by sorting them down the tree from the root to some leaf node.

Challenges for Decision Mining in Business Processes Two important challenges need to be addressed in real-life business processes. The first challenge relates to the quality of data, and the correct interpretation of their semantics. The second challenge relates to the correct interpretation of the control-flow semantics of a process model. Labeling Function(l) : l ∈ T ⇏ L is a partial labeling function association each activity with at most one log event. Invisible Activity : An activity t ∈ T, if t ∉ dom(l). Real-life process models may be different from not real-life process models.

Because invisible activities cannot observed in the log, the first activity is not always sufficient. Invisible activities need to be traced until the next visible activities have been found. Duplicate Activity : t ∈ T is duplicate activity if ∃ t ∈ T t ≠ t’ ⋏ l(t)=l(t’) Although duplicate activities have an associated log event, its occurrence cannot be used to classify the possible choices. The solution to deal with duplicate activities is to treat them in the same way as invisible activities. ′′

If the first transition found in such a branch is neither invisible nor duplicate, ➞ the associated log event can be directly used to characterize the corresponding decision class. If the first transition found in such a branch is either invisible or duplicate, ➞ it is necessary to trace the succeeding transitions Another obstacle can be seen in the correct interpretation of the loop semantics of a process model. Decision points contained in a loop (a) Decision point containing a loop (b) Decision points are loops (c)

Decision Mining with the ProM Framework The Decision Miner plug-in determines the decision points contained in a Petri net model.