Efficient mining of recurrent rules from a sequence database
Download
1 / 21

Efficient Mining of Recurrent Rules from a Sequence Database - PowerPoint PPT Presentation


  • 106 Views
  • Uploaded on
  • Presentation posted in: General

Efficient Mining of Recurrent Rules from a Sequence Database. David Lo Siau -Cheng Khoo Chao Liu DASFAA 2008. Outline. Introduction Preliminaries Generation of Recurrent Rules Algorithm Performance Evaluation Conclusion. Introduction.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha

Download Presentation

Efficient Mining of Recurrent Rules from a Sequence Database

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Efficient Mining of Recurrent Rules from a Sequence Database

David Lo

Siau-Cheng Khoo

Chao Liu

DASFAA 2008


Outline

  • Introduction

  • Preliminaries

  • Generation of Recurrent Rules

  • Algorithm

  • Performance Evaluation

  • Conclusion


Introduction

  • 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

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

  • 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


Preliminaries

  • Checking/Verifying LTL Expressions.

    (main, lock) → (unlock, end)

(main, lock, use) → (unlock, end)


Generation of Recurrent Rules

Concepts and Definitions


Generation of Recurrent Rules

Concepts and Definitions


Generation of Recurrent Rules

Concepts and Definitions


Generation of Recurrent Rules

Concepts and Definitions


Generation of Recurrent Rules

Concepts and Definitions


Generation of Recurrent Rules

Concepts and Definitions

s-support:2

i-support:2

confidence:1


Generation of Recurrent Rules

Concepts and Definitions


Generation of Recurrent Rules

Concepts and Definitions

s-support:2

i-support:2

confidence:1


Generation of Recurrent Rules

Apriori Properties and Non-redundancy


Generation of Recurrent Rules

Apriori Properties and Non-redundancy


Generation of Recurrent Rules

Apriori Properties and Non-redundancy


Algorithm


Performance Evaluation


Conclusion


ad
  • Login