David Lo Siau-Cheng Khoo Chao Liu DASFAA 2008 Efficient Mining of Recurrent Rules from a Sequence Database 1.

Slides:



Advertisements
Similar presentations
A distributed method for mining association rules
Advertisements

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 OSPF Routing Protocols and Concepts – Chapter 11.
CS6133 Software Specification and Verification
1 Semester 2 Module 4 Learning about Other Devices Yuda college of business James Chen
Breaking Trust On The Internet
/ PSWLAB Efficient Decentralized Monitoring of Safety in Distributed System K Sen, A Vardhan, G Agha, G Rosu 20 th July 2007 Presented by.
Chapter 11 Data Link Control (DLC) Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Edi Winarko, John F. Roddick
Microcomputer Networking II St. Cloud State University MCS 426, Fall 1999 Instructor: Adomas Svirskas Introduction Instructor: Visiting Instructor Adomas.
Logical Time Each event is assigned a logical time from a totally ordered set T The logical times for the events must respect any possible dependencies.
Data Mining Techniques Cluster Analysis Induction Neural Networks OLAP Data Visualization.
Real-Time Authentication Using Digital Signature Schema Marissa Hollingsworth BOISECRYPT ‘09.
Slides for Chapter 10: Time and Global State
Transaction Management and Concurrency Control
20101 Synchronization in distributed systems A collection of independent computers that appears to its users as a single coherent system.
SSH : The Secure Shell By Rachana Maheswari CS265 Spring 2003.
Application of Apriori Algorithm to Derive Association Rules Over Finance Data Set Presented By Kallepalli Vijay Instructor: Dr. Ruppa Thulasiram.
Copyright © 2004 Pearson Education, Inc.. Chapter 27 Data Mining Concepts.
Automata and Formal Lanugages Büchi Automata and Model Checking Ralf Möller based on slides by Chang-Beom Choi Provable Software Lab, KAIST.
Time, Clocks, and the Ordering of Events in a Distributed System Leslie Lamport (1978) Presented by: Yoav Kantor.
Introduction to PL/SQL Chapter 9. Objectives Explain the need for PL/SQL Explain the benefits of PL/SQL Identify the different types of PL/SQL blocks.
Syllabus outcomes Describes and applies problem-solving processes when creating solutions Designs, produces and evaluates appropriate solutions.
Chapter Nine The Session Layer. Objectives We’ll see how a new session is created, maintained, and dismantled. The process of logon authentication will.
1 † Prog. Lang. & Sys. Lab Dept of Comp. Science National Uni. of Singapore Current: (Sch. of Info. Systems, Singapore Management Uni.) Efficient Mining.
Software Firewalls © N. Ganesan, Ph.D.. Module Objectives Explore the features of a software firewall such as Zone Alarm Pro.
The Internet 8th Edition Tutorial 2 Basic Communication on the Internet: .
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.
Efficient Data Mining for Calling Path Patterns in GSM Networks Information Systems, accepted 5 December 2002 SPEAKER: YAO-TE WANG ( 王耀德 )
Incident Threading for News Passages (CIKM 09) Speaker: Yi-lin,Hsu Advisor: Dr. Koh, Jia-ling. Date:2010/06/14.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 6 Delivery and Routing of IP Packets.
DISTRIBUTED ALGORITHMS By Nancy.A.Lynch Chapter 18 LOGICAL TIME By Sudha Elavarti.
CEMiner – An Efficient Algorithm for Mining Closed Patterns from Time Interval-based Data Yi-Cheng Chen, Wen-Chih Peng and Suh-Yin Lee ICDM 2011.
Association Rule Mining in Peer-to-Peer Systems Ran Wolff Assaf Shcuster Department of Computer Science Technion I.I.T. Haifa 32000,Isreal.
1 David Lo 1,2 Siau-Cheng Khoo 2 Chao Liu 3 1 Singapore Management University 2 National University of Singapore 3 Microsoft Research, Redmond Mining Past-Time.
Chapter 3: Authentication, Authorization, and Accounting
NetSearch: Googling Large-scale Network Management Data GROUP 2 MEMBERS SAMUEL LAWER WENBO HAN HUAN YAN PEI YAN SHREY YADAV SHUAI YU SHINE PANDITA.
1 Computer Networking Dr. Mohammad Alhihi Communication and Electronic Engineering Department Philadelphia University Faculty of Engineering.
ECEN “Internet Protocols and Modeling”, Spring 2012 Course Materials: Papers, Reference Texts: Bertsekas/Gallager, Stuber, Stallings, etc Class.
1 Efficient Mining of Iterative Patterns for Software Specification Discovery David Lo † Joint work with: Siau-Cheng Khoo † and Chao Liu ‡ † Prog. Lang.
Time, Clocks, and the Ordering of Events in a Distributed System Leslie Lamport Massachusetts Computer Associates,Inc. Presented by Xiaofeng Xiao.
Totally Ordered Broadcast in the face of Network Partitions [Keidar and Dolev,2000] INF5360 Student Presentation 4/3-08 Miran Damjanovic
4BP1 Electronic & Computer Engineering Paul Gildea th Year Final Project Presentation.
Lesson No:12 Introduction to Internet CHBT-01 Basic Micro process & Computer Operatio.
Transmission Control Protocol (TCP) Internet Protocol (IP)
1. Introduction A remote experiment on hydrogen fuel cell testing Biao Han, Xu Yang, Ashraf A. Mousa, Linfeng Zhang Renewable Energy Research Laboratory.
CS533 Concepts of Operating Systems Class 8 Time, Clocks, and the Ordering of Events in a Distributed System By Constantia Tryman.
COMP 655: Distributed/Operating Systems Summer 2011 Dr. Chunbo Chu Week 6: Synchronyzation 3/5/20161 Distributed Systems - COMP 655.
Today’s Agenda  Quiz 4  Temporal Logic Formal Methods in Software Engineering1.
INF3190 – Home Exam 2. Goal The goal of this exercise is to provide network layer reliability for the monitoring/administration tool presented in “home.
Chapter 13 Managing Transactions and Concurrency Database Principles: Fundamentals of Design, Implementation, and Management Tenth Edition.
Chapter 27 Network Management Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
State Modeling. Introduction A state model describes the sequences of operations that occur in response to external stimuli. As opposed to what the operations.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Protocols.
Module 10: Managing and Monitoring Network Access
Internet Protocol: Connectionless Datagram Delivery
SEEM5770/ECLT5840 Course Review
An example design for an Amadeus APIv2 Web Server Application
Chapter 11 Data Link Control (DLC)
Program Monitoring with LTL in EAGLE
Formal Methods in software development
Introduction of Week 13 Return assignment 11-1 and 3-1-5
Basics of Distributed Systems
Slides for Chapter 11: Time and Global State
Formal Methods in software development
Jenhui Chen Office number:
Chapter Five: Network Software Protocol Hierarchies
Slides for Chapter 14: Time and Global States
Assertions and Triggers
Presentation transcript:

David Lo Siau-Cheng Khoo Chao Liu DASFAA 2008 Efficient Mining of Recurrent Rules from a Sequence Database 1

Outline 2 Introduction Preliminaries Generation of Recurrent Rules Algorithm Performance Evaluation Conclusion

Introduction 3 Mining for knowledge from data has been shown useful for many purposes ranging from finance, advertising, bio- informatics and recently software engineering. “ Whenever a series of precedent events occurs, eventually another series of consequent events occurs ”

Introduction 4 1. Resource Locking Protocol: Whenever a lock is acquired, eventually it is released. 2. Internet Banking: Whenever a connection to a bank server is made and an authentication is completed and money transfer command is issued, eventually money is transferred and a receipt is displayed. 3. Network Protocol: Whenever an HDLC connection is made and an acknowledgement is received, eventually a disconnection message is sent and an acknowledgement is received.

Preliminaries 5 Linear-time Temporal Logic (LTL) ‘G’ specifies that globally at every point in time a certain property holds. ‘F’ specifies that a property holds either at that point in time or finally (eventually) it holds. ‘X’ specifies that a property holds at the next event.

Preliminaries 6

7 Checking/Verifying LTL Expressions. (main, lock) → (unlock, end) (main, lock, use) → (unlock, end)

Generation of Recurrent Rules 8 Concepts and Definitions

Generation of Recurrent Rules 9 Concepts and Definitions

Generation of Recurrent Rules 10 Concepts and Definitions

Generation of Recurrent Rules 11 Concepts and Definitions

Generation of Recurrent Rules 12 Concepts and Definitions

Generation of Recurrent Rules 13 Concepts and Definitions s-support:2 i-support:2 confidence:1

Generation of Recurrent Rules 14 Concepts and Definitions

Generation of Recurrent Rules 15 Concepts and Definitions s-support:2 i-support:2 confidence:1

Generation of Recurrent Rules 16 Apriori Properties and Non-redundancy

Generation of Recurrent Rules 17 Apriori Properties and Non-redundancy

Generation of Recurrent Rules 18 Apriori Properties and Non-redundancy

Algorithm 19

Performance Evaluation 20

Conclusion 21