Skip to main content
Article
Non-Redundant Sequential Rules,Theory and Algorithm
Information Systems
  • David LO, Singapore Management University
  • Siau-Cheng Khoo, National University of Singapore
  • Limsoon Wong, National University of Singapore
Publication Type
Journal Article
Version
Publisher’s Version
Publication Date
6-2009
Abstract
A sequential rule expresses a relationship between two series of events happening one after another. Sequential rules are potentially useful for analyzing data in sequential format, ranging from purchase histories, network logs and program execution traces. In this work, we investigate and propose a syntactic characterization of a non-redundant set of sequential rules built upon past work on compact set of representative patterns. A rule is redundant if it can be inferred from another rule having the same support and confidence. When using the set of mined rules as a composite filter, replacing a full set of rules with a non-redundant subset of the rules does not impact the accuracy of the filter. We consider several rule sets based on composition of various types of pattern sets – generators, projected-database generators, closed patterns and projected-database closed patterns. We investigate the completeness and tightness of these rule sets.
Identifier
10.1016/j.is.2009.01.002
Publisher
Elsevier
Creative Commons License
Creative Commons Attribution-Noncommercial-No Derivative Works 4.0
Additional URL
http://doi.ieeecomputersociety.org/10.1016/j.is.2009.01.002
Citation Information
David LO, Siau-Cheng Khoo and Limsoon Wong. "Non-Redundant Sequential Rules,Theory and Algorithm" Information Systems Vol. 34 Iss. 4/5 (2009) p. 438 - 453 ISSN: 0306-4379
Available at: http://works.bepress.com/david_lo/59/