Mining weighted sequential patterns based on length-decreasing support constraints

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We suggest an efficient weighted sequential pattern mining algorithm with length decreasing support constraints. Our approach is to push weight constraints and length decreasing support constraints to improve performance. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Yun, U., Leggett, J. J., & Ong, T. (2006). Mining weighted sequential patterns based on length-decreasing support constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3975 LNCS, pp. 650–651). Springer Verlag. https://doi.org/10.1007/11760146_74

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