Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7310 LNAI 299-304
DOI: 10.1007/978-3-642-30353-1_27
22Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Fournier-Viger, P., Wu, C. W., Tseng, V. S., & Nkambou, R. (2012). Mining sequential rules common to several sequences with the window size constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7310 LNAI, pp. 299–304). https://doi.org/10.1007/978-3-642-30353-1_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free