Bidirectional Mining of Non-Redundant Recurrent Rules from a Sequence Database
We are interested in scalable mining of a nonredundant set of 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”. They are intuitive and characterize behaviors in many dom...
Saved in:
Main Authors: | LO, David, DING, Bolin, Lucia, -, Han, Jiawei |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2011
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1344 http://www.cs.uiuc.edu/homes/hanj/pdf/icde11_dlo.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Efficient Mining of Recurrent Rules from a Sequence Database
by: LO, David, et al.
Published: (2008) -
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
by: DING, Bolin, et al.
Published: (2009) -
Efficient mining of recurrent rules from a sequence database
by: Lo, D., et al.
Published: (2013) -
Non-Redundant Sequential Rules - Theory and Algorithm
by: LO, David, et al.
Published: (2009) -
Mining progressive confident rules in sequence databases
by: Zhang, M.
Published: (2014)