Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventually a series of consequent events occurs". Recurrent rules are intuitive and characterize behaviors in many domains....
Saved in:
Main Authors: | LO, David, KHOO, Siau-Cheng, LIU, Chao |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2008
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/961 http://portal.acm.org/citation.cfm?id=1802525 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Bidirectional Mining of Non-Redundant Recurrent Rules from a Sequence Database
by: LO, David, et al.
Published: (2011) -
Efficient mining of recurrent rules from a sequence database
by: Lo, D., et al.
Published: (2013) -
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
by: DING, Bolin, et al.
Published: (2009) -
Mining Temporal Rules from Program Execution Traces
by: LO, David, et al.
Published: (2007) -
Mining Past-Time Temporal Rules from Execution Traces
by: LO, David, et al.
Published: (2008)