Download presentation
Presentation is loading. Please wait.
Published byAmelia Webster Modified over 9 years ago
1
Discovering Declare Maps R.P. Jagadeesh Chandra Bose (JC) Joint Work with Fabrizio M. Maggi and Wil M.P. van der Aalst
2
The Apriori Approach Discover Frequent Activity Sets (Candidate Sets) {A, B}, {C, E}, {A, E}, … Generate Dispositions (A, B), (B, A), (C, E), (E, C), (A, E), (E, A), … Instantiate Constraints response (A,B), response (B,A), … Assess Significance and Prune Constraints Support, confidence, interest factor, … F.M. Maggi, R.P.J.C. Bose and W.M.P. van der Aalst. Efficient Discovery of Understandable Declarative Process Models from Event Logs, CAiSE 2012, pp 270-285
3
The Problem of Too Many Constraints Naïve approach Apriori approach
4
Dealing with Redundancy Retain the strongest F.M. Maggi, R.P.J.C. Bose and W.M.P. van der Aalst. A Knowledge-Based Integrated Approach for Discovering and Repairing Declare Maps, CAiSE 2013 (to appear)
5
Dealing with Redundancy transitive reduction Case, M.L.: Online Algorithms To Maintain A Transitive Reduction. In: Department of EECS, University of California, Berkeley, CS 294-8 (2006)
6
Transitive Reduction (Example)
7
Transitive Reduction (Mixed Constraints)
8
Reduction Rules
10
Putting it all together
11
Integrating Domain Knowledge
12
Conceptual Grouping of Activities Intra-group constraints Inter-group constraints
13
Conceptual Grouping of Activities
14
Apriori Declare Map Reference set of templates/activities Repair the map add stronger constraints remove constraints that no longer hold Use for selecting pruning metric thresholds
15
Repairing a Declare Map (Example)
16
Framework
17
Extending with Data Issues Too many constraints (not all may be interesting) ambiguities in associating events −, Lack of diagnostic information R.P.J.C. Bose, F.M. Maggi and W.M.P. van der Aalst. Enhancing Declare Maps Based on Event Correlations, BPM 2013 (to appear)
18
Declare Model with Correlations
19
Discovering Correlations Relationship between attributes continuous (, >=, =, !=) string/boolean (=, !=) timestamps (before, after, time diff) Comparable attributes apriori knowledge attributes of the same type
20
Framework, (non-ambiguous), (ambiguous) # instances where correlation is true # instances Support (correlation) =
21
Discovered Correlations (Example) A = First outpatient consultation, B = administrative fee - the first pol C = unconjugated bilirubin D = bilirubin- total E = rhesus factor d - Centrifuge method F = red cell antibody screening
22
Pruning Constriants
23
Discriminatory Patterns Constraint activations can be classified into different categories conformant vs. non-conformant slow, medium, fast based on their response times …
24
Framework Class Labeling Feature Extraction feasible correlations antecedent activity attributes case-level attributes Discover Patterns
25
Discriminatory Patterns (Example) response (A,B): 517 non-ambiguous instances : 60 violations A = First outpatient consultation, B = administrative fee - the first pol A.Section is Section 5 AND DiagnosisCodeSet is {106; 823} then violation (TP=5, FP=1) A.Section is not equal to Section 5 AND A.Producercode is SGSX then violation (TP=3, FP=1)
26
Declare Map with Correlations
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.