Process Mining Control flow process discovery Fabrizio Maria
Process Mining Control flow process discovery Fabrizio Maria Maggi (based on Process Mining book – Springer copyright 2011 and lecture material by Marlon Dumas, Wil van der Aalst and Ana Karla Alves de Medeiros http: //www. processmining. org)
Process Mining
Control-Flow Mining Start Get Ready 1. 2. 3. 1. 4. 2. 5. 3. 6. 4. 7. 5. 8. 6. 7. 8. 9. 10. Start 1. Get Ready Start 1. 2. Start Get Ready Travel by Train 2. 3. Start Get. Travel Readyby Train Beta Event Starts 3. 4. Get Ready Travel Car Starts Betaby. Event Visit Brewery 4. 5. Travel. Beta Event Starts by. Give Car a Talk Have Dinner 5. 6. Conference Give a Starts Talk Visit Brewery Go Home 6. 7. Join Reception Visit Brewery Have Dinner Travel by Train 7. 8. Have Dinner Go. Dinner Home 8. 9. Go Home Go Travel Home by Train 9. Pay Parking 10. Travel by Car Travel by Train Travel by Car Conference Starts Give a Talk Join Reception Mined Model Have Dinner End Go Home Event Log Pay Parking Travel by Train Discovery Techniques: Control-Flow Mining Travel by Car End
Mining Common Constructs Get Ready • • Sequence Splits Joins Loops Non-Free Choice Invisible Tasks Duplicate Tasks Travel by Train Travel by Car Defense Starts Ask Question Give a Talk Defense Ends Have Drinks Go Home Travel by Train Pay Parking Travel by Car
Mining Common Constructs Get Ready • • Sequence Splits Joins Loops Non-Free Choice Invisible Tasks Duplicate Tasks + noise in logs! Travel by Train Travel by Car Defense Starts Ask Question Give a Talk Defense Ends Have Drinks Go Home Travel by Train Pay Parking Travel by Car
α-algorithm Basic Idea: Ordering relations • Direct succession: x>y iff for some case x is directly followed by y. • Causality: x y iff x>y and not y>x. • Parallel: x||y iff x>y and y>x • Unrelated: x#y iff not x>y and not y>x. case case case. . . 1 2 3 3 1 1 2 4 2 : : : : : task task task A A A B B C C A B ABCD ACBD EF A>B A>C B>D C>B C>D E>F B||C C||B A C B D C D E F
Basic Idea: Example
Basic Idea: Example
Basic Idea: Footprints
Basic Idea: Patterns
α-algorithm
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
α-algorithm: Applicative Example
Limitations: short loops of length 1 b>b and not b>b implies b b (impossible!)
Limitations: short loops of length 1 Example “Short 1”
Limitations: short loops of length 2 c>b and b>c implies c||b and b||c instead of c b and b c
Limitations: short loops of length 2 Example “Short 2”
Limitations: non-free-choice nets Example “nonlocal”
Limitations: invisible tasks Example “invisible”
Mining Common Constructs Get Ready • • Sequence Splits Joins Loops Non-Free Choice Invisible Tasks Duplicate Tasks Travel by Train Travel by Car Defense Starts Ask Question Give a Talk Defense Ends Have Drinks Go Home Travel by Train Pay Parking Travel by Car
Mining Common Constructs Get Ready • • Sequence Splits Joins Loops Non-Free Choice Invisible Tasks Duplicate Tasks + noise in logs! Travel by Train Travel by Car Defense Starts Ask Question Give a Talk Defense Ends Have Drinks Go Home Travel by Train Pay Parking Travel by Car
Heuristic Miner
Heuristic Miner
Heuristic Miner
Heuristic Miner Example “heuristic”
Mining Common Constructs Get Ready • • Sequence Splits Joins Loops Non-Free Choice Invisible Tasks Duplicate Tasks Travel by Train Travel by Car Defense Starts Ask Question Give a Talk Defense Ends Have Drinks Go Home Travel by Train Pay Parking Travel by Car
Mining Common Constructs Get Ready • • Sequence Splits Joins Loops Non-Free Choice Invisible Tasks Duplicate Tasks + noise in logs! Travel by Train Travel by Car Defense Starts Ask Question Give a Talk Defense Ends Have Drinks Go Home Travel by Train Pay Parking Travel by Car
Genetic Miner
GPM – Fitness Measure Start • Guides the search! Get Ready Travel by Train Conference Starts Travel by Car Give a Talk Visit Brewery Have Dinner Go Home Pay Parking Travel by Train Travel by Car End
Genetic Miner: Crossover
Genetic Miner: Mutation
- Slides: 41