Efficient Mining of Recurrent Rules from a Sequence Database
Conference Proceeding Article
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. An example is in the domain of software specifications, in which the rules capture a family of program properties beneficial to program verification and bug detection. Recurrent rules generalize existing work on sequential and episode rules by considering repeated occurrences of premise and consequent events within a sequence and across multiple sequences, and by removing the "window" barrier. Bridging the gap between mined rules and program specifications, we formalize our rules in linear temporal logic. We introduce and apply a novel notion of rule redundancy to ensure efficient mining of a compact representative set of rules. Performance studies on benchmark datasets and a case study on an industrial system have been performed to show the scalability and utility of our approach.
Proceedings of the 13th International Conference on Database Systems for Advance Applications (DASFAA)
City or Country
New Delhi, India
LO, David; KHOO, Siau-Cheng; and LIU, Chao.
Efficient Mining of Recurrent Rules from a Sequence Database. (2008). Proceedings of the 13th International Conference on Database Systems for Advance Applications (DASFAA). Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/961