Discovering Declare Maps R.P. Jagadeesh Chandra Bose (JC) Joint Work with Fabrizio M. Maggi and Wil M.P. van der Aalst.

Slides:

Advertisements

Similar presentations

1 CS 391L: Machine Learning: Rule Learning Raymond J. Mooney University of Texas at Austin.

Advertisements

Mining Association Rules from Microarray Gene Expression Data.

Data Mining Techniques Association Rule

Han-na Yang Trace Clustering in Process Mining M. Song, C.W. Gunther, and W.M.P. van der Aalst.

Association Rule Mining. 2 The Task Two ways of defining the task General –Input: A collection of instances –Output: rules to predict the values of any.

10 -1 Lecture 10 Association Rules Mining Topics –Basics –Mining Frequent Patterns –Mining Frequent Sequential Patterns –Applications.

Aligning Event Logs And Declare Models for Conformance Checking Massimiliano de Leoni, Fabrizio Maggi Wil van der Aalst.

Models vs. Reality dr.ir. B.F. van Dongen Assistant Professor Eindhoven University of Technology

Data Mining Association Analysis: Basic Concepts and Algorithms

Mining Declarative Models using Intervals Jan Martijn van der Werf Ronny Mans Wil van der Aalst.

Association Analysis. Association Rule Mining: Definition Given a set of records each of which contain some number of items from a given collection; –Produce.

Learning Fuzzy Association Rules and Associative Classification Rules Jianchao Han Computer Science Department California State University Dominguez Hills.

Block-Structured Process Discovery: Filtering Infrequent Behaviour Sander Leemans Dirk Fahland Wil van der Aalst Eindhoven University of Technology.

Interactive Generation of Integrated Schemas Laura Chiticariu et al. Presented by: Meher Talat Shaikh.

Data Mining Association Analysis: Basic Concepts and Algorithms

Learning to Extract Form Labels Nguyen et al.. The Challenge We want to retrieve and integrate online databases We want to retrieve and integrate online.

6/23/2015CSE591: Data Mining by H. Liu1 Association Rules Transactional data Algorithm Applications.

DATA MINING -ASSOCIATION RULES-

UML CASE Tool. ABSTRACT Domain analysis enables identifying families of applications and capturing their terminology in order to assist and guide system.

1 ACCTG 6910 Building Enterprise & Business Intelligence Systems (e.bis) Association Rule Mining Olivia R. Liu Sheng, Ph.D. Emma Eccles Jones Presidential.

Sai Moturu. Introduction Current approaches to microarray data analysis –Analysis of experimental data followed by a posterior process where biological.

Association Rules Olson Yanhong Li. Fuzzy Association Rules Association rules mining provides information to assess significant correlations in large.

Process Mining: An iterative algorithm using the Theory of Regions Kristian Bisgaard Lassen Boudewijn van Dongen Wil van.

Mining Association Rules

Mining Sequences. Examples of Sequence Web sequence:  {Homepage} {Electronics} {Digital Cameras} {Canon Digital Camera} {Shopping Cart} {Order Confirmation}

Mining Association Rules

Pattern Recognition Lecture 20: Data Mining 3 Dr. Richard Spillman Pacific Lutheran University.

Special Products Section 6.4. Find the product. (x + 2)(x + 2) (x + 3)(x + 3)

A university for the world real R © 2009, Chapter 23 Epilogue Wil van der Aalst Michael Adams Arthur ter Hofstede Nick Russell.

Kansas State University Department of Computing and Information Sciences CIS 830: Advanced Topics in Artificial Intelligence From Data Mining To Knowledge.

Intrusion Detection Jie Lin. Outline Introduction A Frame for Intrusion Detection System Intrusion Detection Techniques Ideas for Improving Intrusion.

Alert Correlation for Extracting Attack Strategies Authors: B. Zhu and A. A. Ghorbani Source: IJNS review paper Reporter: Chun-Ta Li ( 李俊達 )

Abrar Fawaz AlAbed-AlHaq Kent State University October 28, 2011

Jianmin Wang 1, Shaoxu Song 1, Xuemin Lin 2, Xiaochen Zhu 1, Jian Pei 3 1 Tsinghua University, China 2 University of New South Wales, Australia 3 Simon.

1 Bayesian Methods. 2 Naïve Bayes New data point to classify: X=(x 1,x 2,…x m ) Strategy: – Calculate P(C i /X) for each class C i. – Select C i for which.

Bab 5 Classification: Alternative Techniques Part 1 Rule-Based Classifer.

1 Discovering Robust Knowledge from Databases that Change Chun-Nan HsuCraig A. Knoblock Arizona State UniversityUniversity of Southern California Journal.

Expert Systems with Applications 34 (2008) 459–468 Multi-level fuzzy mining with multiple minimum supports Yeong-Chyi Lee, Tzung-Pei Hong, Tien-Chin Wang.

Stefan Mutter, Mark Hall, Eibe Frank University of Freiburg, Germany University of Waikato, New Zealand The 17th Australian Joint Conference on Artificial.

Conceptual Model or Domain Models Chapter10 Applying UML and pattern.

CS 8751 ML & KDDSupport Vector Machines1 Mining Association Rules KDD from a DBMS point of view –The importance of efficiency Market basket analysis Association.

Outline Knowledge discovery in databases. Data warehousing. Data mining. Different types of data mining. The Apriori algorithm for generating association.

Data Mining Association Rules: Advanced Concepts and Algorithms

Fast Algorithms for Mining Association Rules Rakesh Agrawal and Ramakrishnan Srikant VLDB '94 presented by kurt partridge cse 590db oct 4, 1999.

Privacy-preserving rule mining. Outline  A brief introduction to association rule mining  Privacy preserving rule mining Single party  Perturbation.

Association Rule Mining Data Mining and Knowledge Discovery Prof. Carolina Ruiz and Weiyang Lin Department of Computer Science Worcester Polytechnic Institute.

Compliance Management Elham Ramezani 1. Enterprises are governed by regulations Compliance Report ✓ ✗ ✗ ✓ ✗ ✗ Laws & Regulations Diagnostic Information.

Challenges in Mining Large Image Datasets Jelena Tešić, B.S. Manjunath University of California, Santa Barbara

Association Rule Mining

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

Alignment-based Precision Checking A. Adriansyah 1, J. Munoz Gamma 2, J. Carmona 2, B.F. van Dongen 1, W.M.P. van der Aalst 1 Tallinn, 3 September 2012.

Decomposing Data-aware Conformance Checking Massimiliano de Leoni, Jorge Munoz-Gama, Josep Carmona, Wil van der Aalst PAGE 0.

Conceptual Databases Design Step 1 © Pearson Education Limited 1995, 2005.

Discriminative Frequent Pattern Analysis for Effective Classification By Hong Cheng, Xifeng Yan, Jiawei Han, Chih- Wei Hsu Presented by Mary Biddle.

Intelligent Database Systems Lab N.Y.U.S.T. I. M. Towards comprehensive support for organizational mining Presenter : Yu-hui Huang Authors : Minseok Song,

Data Mining  Association Rule  Classification  Clustering.

1 Discovering Calendar-based Temporal Association Rules SHOU Yu Tao May. 21 st, 2003 TIME 01, 8th International Symposium on Temporal Representation and.

1998 년 8 월 7 일 Data Engineering Lab 성 유진 1 Exploratory Mining and Pruning Optimization of Constrained Associations Rules.

What is this? SE-2030 Dr. Mark L. Hornick 1. Same images with different levels of detail SE-2030 Dr. Mark L. Hornick 2.

Service Analysis and Simulation in Process Mining Doctoral Consortium, BPM14’ Arik Senderovich Advisers: Avigdor Gal and Avishai Mandelbaum

Understanding Deviations AIS Nov.2014 Elham Ramezani Dirk Fahland Wil M.P. van der Aalst.

Discovering Models for State-based Processes M.L. van Eck, N. Sidorova, W.M.P. van der Aalst.

MTAT Business Process Management (BPM) Lecture 11: Process Monitoring and Mining Fabrizio Maggi (based on lecture material by Marlon Dumas, Wil.

Profiling based unstructured process logs

Association Rule Mining

A General Framework for Correlating Business Process Characteristics

Association Rule Mining

Market Basket Analysis and Association Rules

Data Mining for Finding Connections of Disease and Medical and Genomic Characteristics Vipin Kumar William Norris Professor and Head, Department of Computer.

Neo4j for Process Mining

Presentation transcript:

Discovering Declare Maps R.P. Jagadeesh Chandra Bose (JC) Joint Work with Fabrizio M. Maggi and Wil M.P. van der Aalst

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

The Problem of Too Many Constraints Naïve approach Apriori approach

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)

Dealing with Redundancy transitive reduction Case, M.L.: Online Algorithms To Maintain A Transitive Reduction. In: Department of EECS, University of California, Berkeley, CS (2006)

Transitive Reduction (Example)

Transitive Reduction (Mixed Constraints)

Reduction Rules

Putting it all together

Integrating Domain Knowledge

Conceptual Grouping of Activities Intra-group constraints Inter-group constraints

Conceptual Grouping of Activities

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

Repairing a Declare Map (Example)

Framework

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)

Declare Model with Correlations

Discovering Correlations Relationship between attributes continuous (, >=, =, !=) string/boolean (=, !=) timestamps (before, after, time diff) Comparable attributes apriori knowledge attributes of the same type

Framework, (non-ambiguous), (ambiguous) # instances where correlation is true # instances Support (correlation) =

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

Pruning Constriants

Discriminatory Patterns Constraint activations can be classified into different categories conformant vs. non-conformant slow, medium, fast based on their response times …

Framework Class Labeling Feature Extraction feasible correlations antecedent activity attributes case-level attributes Discover Patterns

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)

Declare Map with Correlations