Mining sequential rules common to several sequences with the window size constraint

Authors:
Philippe Fournier-Viger;Cheng-Wei Wu;Vincent S. Tseng;Roger Nkambou
Affiliations:
Dept. of Computer Sciences, University of Moncton, Canada;Dep. of Computer Science and Information Engineering, National Cheng Kung University, Taiwan;Dep. of Computer Science and Information Engineering, National Cheng Kung University, Taiwan;Dept. of Computer Sciences, University of Quebec in Montreal, Canada
Venue:
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Year:
2012

Citing 6
Cited 0

SPADE: an efficient algorithm for mining frequent sequences

Machine Learning
Discovery of Frequent Episodes in Event Sequences

Data Mining and Knowledge Discovery
Non-redundant sequential rules-Theory and algorithm

Information Systems
RuleGrowth: mining sequential rules common to several sequences by pattern-growth

Proceedings of the 2011 ACM Symposium on Applied Computing
CMRules: Mining sequential rules common to several sequences

Knowledge-Based Systems
Prediction mining – an approach to mining association rules for prediction

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for mining sequential rules common to several sequences, such that rules have to appear within a maximum time span. Experimental results with real-life datasets show that the algorithm can reduce the execution time, memory usage and the number of rules generated by several orders of magnitude compared to previous algorithms.