heuristics miner for time intervals
play

Heuristics Miner for Time Intervals Andrea Burattin and Alessandro - PowerPoint PPT Presentation

Dec 04, 2023 •120 likes •414 views

Heuristics Miner for Time Intervals Andrea Burattin and Alessandro Sperduti Department of Pure and Applied Mathematics University of Padua, Italy April 28th, 2010 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  1. Heuristics Miner for Time Intervals Andrea Burattin and Alessandro Sperduti Department of Pure and Applied Mathematics University of Padua, Italy April 28th, 2010 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  2. What is Process Mining I Business Process From the IEEE Glossary: “ a sequence of steps performed for a given purpose; for example, the software development process ”, that changes inputs into outputs . Goods wrapping Goods Order received Shipping available Shipping note Each performed action is registered into a log Slide 2 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  3. What is Process Mining II Main process mining areas When the model of the process is not available: Control-flow discovery aims to build a model describing the behaviour of the process; When the model of the process is available: Conformance analysis tries to fit a log to the given process model. Independent from the process model availability: Organizational mining tries to extract a “social network” that establishes relations between actions’ authors; Slide 3 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  4. What is Process Mining III Extracted models Slide 4 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  5. Control–flow discovery example run # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 10:00 5 Shipping apr 26, 2010 12:30 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  6. Control–flow discovery example run Order received # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 10:00 5 Shipping apr 26, 2010 12:30 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  7. Control–flow discovery example run Order Payment received received # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 #1 > #2 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 10:00 5 Shipping apr 26, 2010 12:30 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  8. Control–flow discovery example run Order Payment Goods received received available # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 #2 > #3 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 10:00 5 Shipping apr 26, 2010 12:30 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  9. Control–flow discovery example run Order Payment Goods Shipping received received available # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 #3 > #4 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 10:00 5 Shipping apr 26, 2010 12:30 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  10. Control–flow discovery example run Order Payment Goods Shipping received received available # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 10:00 5 Shipping apr 26, 2010 12:30 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  11. Control–flow discovery example run Order Payment received reminder Payment Goods Shipping received available # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 #1 > #2 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 10:00 5 Shipping apr 26, 2010 12:30 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  12. Control–flow discovery example run Order Payment received reminder Payment Goods Shipping received available # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 #2 > #3 4 Goods available apr 26, 2010 10:00 5 Shipping apr 26, 2010 12:30 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  13. Control–flow discovery example run Order Payment received reminder Payment Goods Shipping received available # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 10:00 #3 > #4 5 Shipping apr 26, 2010 12:30 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  14. Control–flow discovery example run Order Payment received reminder Payment Goods Shipping received available # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 10:00 5 Shipping apr 26, 2010 12:30 #4 > #5 Slide 5 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  15. Control–flow discovery example run # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 12:30 5 Shipping apr 26, 2010 12:30 Slide 6 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  16. Control–flow discovery example run # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Payment reminder apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Goods available apr 26, 2010 12:30 5 Shipping apr 26, 2010 12:30 Slide 6 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  17. Control–flow discovery example run # Activities Completion Time Instance 1 1 Order received apr 21, 2010 12:00 2 Payment received apr 22, 2010 09:00 3 Goods available apr 26, 2010 08:30 4 Shipping apr 26, 2010 10:15 Instance 2 1 Order received apr 23, 2010 15:45 2 Goods available apr 25, 2010 15:45 3 Payment received apr 25, 2010 17:31 4 Payment reminder apr 26, 2010 12:30 5 Shipping apr 26, 2010 12:30 Slide 6 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

  18. Heuristics Miner, core behaviour I Heuristics Miner evaluates a “ dependency function ” between two activities (e.g. X , Y ), in order to decide if the relationship holds: | X > Y | − | Y > X | X ⇒ Y = | X > Y | + | Y > X | + 1 Where: X > Y holds if X executed at time t and Y at t + 1 | X > Y | is the number of times that X > Y holds in the log With all the relations above a threshold, the algorithm builds a directed graph with all the dependencies. Slide 7 of 16 Andrea Burattin and Alessandro Sperduti Heuristics Miner for Time Intervals

Recommend

Time-Series Data Numerical data obtained at regular time intervals The time intervals can

Time-Series Data Numerical data obtained at regular time intervals The time intervals can

Time-Series Data Numerical data obtained at regular time intervals The time intervals can be annually, quarterly, daily, hourly, etc. Example: Year: 1999 2000 2001 2002 2003 Sales: 75.3 74.2 78.5 79.7 80.2

1.05k views • 55 slides
MINER n A Cross Sections what is MINER n A ? why MINER n A ? n beam and n flux n / n inclusive

MINER n A Cross Sections what is MINER n A ? why MINER n A ? n beam and n flux n / n inclusive

MINER n A Cross Sections what is MINER n A ? why MINER n A ? n beam and n flux n / n inclusive x-sections nuclear effects NuFACT2017 Alessandro Bravar Uppsala Universit de Genve 26 Sept. 2017 for the Miner n a Collaboration Neutrino

285 views • 25 slides
The MINER A A The MINER Experiment Experiment Csar Castromonte Csar Castromonte

The MINER A A The MINER Experiment Experiment Csar Castromonte Csar Castromonte

The MINER A A The MINER Experiment Experiment Csar Castromonte Csar Castromonte CBPF Brazil On behalf of MINER MINER A A Collaboration A Detector Full MINER User's Meeting, June 2-3, 2010 Outline Outline

531 views • 23 slides
The category of 1:1 ratio caused by assimilations of two neighboring empty time intervals Ryota

The category of 1:1 ratio caused by assimilations of two neighboring empty time intervals Ryota

The category of 1:1 ratio caused by assimilations of two neighboring empty time intervals Ryota Miyauchi & Yoshitaka Nakajima Kyushu University, Faculty of Design, Fukuoka, Japan Assimilation of time intervals Underestimated PSE of t1 =

414 views • 25 slides
Clocks Some clocks use motion to mark their intervals Others clocks dont appear to

Clocks Some clocks use motion to mark their intervals Others clocks dont appear to

Clocks 1 Clocks 2 Observations About Clocks They divide time into uniform intervals The measure time by counting those intervals Clocks Some clocks use motion to mark their intervals Others clocks dont appear to involve motion

305 views • 3 slides
n N Deep Inelastic Scattring at MINER n A Alessandro Bravar Universit de Genve for the

n N Deep Inelastic Scattring at MINER n A Alessandro Bravar Universit de Genve for the

n N Deep Inelastic Scattring at MINER n A Alessandro Bravar Universit de Genve for the MINER n A Collaboration The MINER n A Detector MINER n A, NIM A743 (2014) 130 120 plastic fine-grained scintillator modules stacked along the beam

495 views • 23 slides
Time Intervals as a Behavioral Biometric John (Vinnie) Monaco Seidenberg School of CSIS, Pace

Time Intervals as a Behavioral Biometric John (Vinnie) Monaco Seidenberg School of CSIS, Pace

Introduction Data Modeling Conclusions Time Intervals as a Behavioral Biometric John (Vinnie) Monaco Seidenberg School of CSIS, Pace University November 11, 2015 http://vmonaco.com/dissertation John (Vinnie) Monaco Time Intervals as a

973 views • 50 slides
Towards Visualization Scalability through Time Intervals and Hierarchical Organization of

Towards Visualization Scalability through Time Intervals and Hierarchical Organization of

Towards Visualization Scalability through Time Intervals and Hierarchical Organization of Monitoring Data Lucas Mello Schnorr, Guillaume Huard, Philippe Olivier Alexandre Navaux Federal University of Rio Grande do Sul, Brazil Grenoble

471 views • 23 slides
Decision Aid Methodologies In Transportation Lecture 7: Heuristics Heuristics Shadi SHARIF

Decision Aid Methodologies In Transportation Lecture 7: Heuristics Heuristics Shadi SHARIF

Decision Aid Methodologies In Transportation Lecture 7: Heuristics Heuristics Shadi SHARIF AZADEH Transport and Mobility Laboratory TRANSP-OR cole Polytechnique Fdrale de Lausanne EPFL Heuristics A heuristic is a technique designed for

632 views • 28 slides
Outline CP for VRP DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Construction Heuristics

Outline CP for VRP DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Construction Heuristics

Construction Heuristics Improvement Heuristics Metaheuristics Outline CP for VRP DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Construction Heuristics Construction Heuristics for CVRP Construction Heuristics for VRPTW Lecture 27 Vehicle

589 views • 15 slides
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences Thomas Schmidt 1

Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences Thomas Schmidt 1

Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences Thomas Schmidt 1 and Jens Stoye 2 1 International NRW Graduate School in Bioinformatics and Genome Research, Center of Biotechnology, Universit at Bielefeld, 33594

260 views • 12 slides
The CPLEX Library: MIP Heuristics Ed Rothberg, ILOG, Inc. 1 Motivation for Heuristics Why not

The CPLEX Library: MIP Heuristics Ed Rothberg, ILOG, Inc. 1 Motivation for Heuristics Why not

The CPLEX Library: MIP Heuristics Ed Rothberg, ILOG, Inc. 1 Motivation for Heuristics Why not wait for branching? Produce feasible solutions as quickly as possible Often satisfies user demands Avoid exploring unproductive subtrees

465 views • 12 slides
Manchester UK Professor Jorge Ribeiro Patrick Ribeiro 1 SAS/ETS Econometrics Time Series

Manchester UK Professor Jorge Ribeiro Patrick Ribeiro 1 SAS/ETS Econometrics Time Series

Survival Data Mining using Enterprise Miner and Proportional Hazard Cox Model 25 th June 2015 Manchester UK Professor Jorge Ribeiro Patrick Ribeiro 1 SAS/ETS Econometrics Time Series Enterprise Miner 13.2 PROC ARIMA Survival Analysis

663 views • 47 slides
Sensitivity to Sleep Deprivation. Analysis from Short to Long Time Intervals. LATOUR Philippe and

Sensitivity to Sleep Deprivation. Analysis from Short to Long Time Intervals. LATOUR Philippe and

New PVT Metrics with an Improved Sensitivity to Sleep Deprivation. Analysis from Short to Long Time Intervals. LATOUR Philippe and VAN DROOGENBROECK Marc University of Lige Belgium 20 March 2017 10th Int. Conf. on Managing Fatigue (San

479 views • 37 slides
Miner Lake Association Spring 2017 Meeting May 27, 2017 Agenda Approve Minutes from Fall

Miner Lake Association Spring 2017 Meeting May 27, 2017 Agenda Approve Minutes from Fall

Miner Lake Association Spring 2017 Meeting May 27, 2017 Agenda Approve Minutes from Fall Meeting Treasurer Report Update on the Miner Lake Dam Water Quality Monitoring - Membership Topics and Q/A Miner Lake Dam Dam Construction completed

369 views • 15 slides
Maths Measurement Maths | Year 4 | Measurement | Telling the Time 12-Hour and 24-Hour | Lesson 1

Maths Measurement Maths | Year 4 | Measurement | Telling the Time 12-Hour and 24-Hour | Lesson 1

Maths Measurement Maths | Year 4 | Measurement | Telling the Time 12-Hour and 24-Hour | Lesson 1 of 4: Telling the Time Minute Intervals Aim I can tell the time to minute intervals. Success Criteria I can count single minutes in a

643 views • 30 slides
Confidence intervals for the mixing time of a reversible Markov chain from a single sample path

Confidence intervals for the mixing time of a reversible Markov chain from a single sample path

Confidence intervals for the mixing time of a reversible Markov chain from a single sample path Daniel Hsu Aryeh Kontorovich Csaba Szepesvri Columbia University, Ben-Gurion University, University of Alberta ITA 2016 1

681 views • 52 slides
Thinking about the Heuristics Examples and the Classic Nine Heuristics 1 Simple and natural

Thinking about the Heuristics Examples and the Classic Nine Heuristics 1 Simple and natural

Thinking about the Heuristics Examples and the Classic Nine Heuristics 1 Simple and natural dialogue Conform to the users conceptual model. Match the users task in as natural a way as possible maximize mapping between interface and

472 views • 22 slides
Intro to Confidence Intervals SECTION 10.1 1 Confidence Intervals Slides.notebook December 22,

Intro to Confidence Intervals SECTION 10.1 1 Confidence Intervals Slides.notebook December 22,

Confidence Intervals Slides.notebook December 22, 2015 Intro to Confidence Intervals SECTION 10.1 1 Confidence Intervals Slides.notebook December 22, 2015 Definitions Statistical Inference: estimate of the characteristics of a

425 views • 19 slides
Processing Measurement Uncertainty: From Intervals and p-Boxes to Probabilistic Nested Intervals

Processing Measurement Uncertainty: From Intervals and p-Boxes to Probabilistic Nested Intervals

Processing Measurement Uncertainty: From Intervals and p-Boxes to Probabilistic Nested Intervals Konstantin K. Semenov 1 , Gennady N. Solopchenko 1 , and Vladik Kreinovich 2 semenov.k.k@gmail.com, g.n.solopchenko@mail.ru, vladik@utep.edu 1

546 views • 16 slides
Confidence Intervals II 18.05 Spring 2014 Agenda Polling: estimating in Bernoulli( ). CLT

Confidence Intervals II 18.05 Spring 2014 Agenda Polling: estimating in Bernoulli( ). CLT

Confidence Intervals II 18.05 Spring 2014 Agenda Polling: estimating in Bernoulli( ). CLT large sample confidence intervals for the mean. Three views of confidence intervals. Constructing a confidence interval without normality: the

478 views • 18 slides
Confidence Intervals II 18.05 Spring 2014 Agenda Polling: estimating in Bernoulli( ). CLT

Confidence Intervals II 18.05 Spring 2014 Agenda Polling: estimating in Bernoulli( ). CLT

Confidence Intervals II 18.05 Spring 2014 Agenda Polling: estimating in Bernoulli( ). CLT large sample confidence intervals for the mean. Three views of confidence intervals. Constructing a confidence interval without normality: the

644 views • 16 slides
Fuzzy Time Intervals System Description of the FuTILibrary Hans J urgen Ohlbach (Edgar

Fuzzy Time Intervals System Description of the FuTILibrary Hans J urgen Ohlbach (Edgar

Fuzzy Time Intervals System Description of the FuTILibrary Hans J urgen Ohlbach (Edgar Stoffel) Inst. f ur Informatik, LMU Munich H.J. Ohlbach (E. Stoffel) (LMU) FuTI 1 / 7 Background: The CTTN System CTTN: Computational

420 views • 7 slides
Confidence Intervals for Normal Data 18.05 Spring 2014 Agenda Today Review of critical values

Confidence Intervals for Normal Data 18.05 Spring 2014 Agenda Today Review of critical values

Confidence Intervals for Normal Data 18.05 Spring 2014 Agenda Today Review of critical values and quantiles. Computing z , t , 2 confidence intervals for normal data. Conceptual view of confidence intervals. Confidence intervals for polling

377 views • 15 slides

More recommend