Abstract
The problem of sequential pattern mining is one of the several that has deserved particular attention on the general area of data mining. Despite the important developments in the last years, the best algorithm in the area (PrefixSpan) does not deal with gap constraints and consequently doesn’t allow for the introduction of background knowledge into the process. In this paper we present the generalization of the PrefixSpan algorithm to deal with gap constraints, using a new method to generate projected databases. Studies on performance and scalability were conducted in synthetic and real-life datasets, and the respective results are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R. and R. Srikant, “Mining sequential patterns”, in Proc. Int’l Conf. Data Engineering (1995), 3–14
Antunes, C. and A. Oliveira, “Temporal data mining: an overview” in Proc. Workshop on Temporal Data Mining (KDD’01) (2001), 1–13
Fama, E., “Efficient Capital Markets: a review of theory and empirical work”. Journal of Finance (1970) 383–417
Grossman, R. and C. Kamath et all, Data Mining for Scientific and Engineering Applications. Kluwer Academic Publishers (1998)
Pei, J, J. Han et all “PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth” in Proc. Int’l Conf. Data Engineering (ICDE 01) (2001)
Shahar, Y. and M.A. Musen, “Knowledge-Based Temporal Abstraction in Clinical Domains” in Artificial Intelligence in Medicine 8, (1996) 267–298
Srikant, R. and R. Agrawal, “Mining Sequential Patterns: Generalizations and Performance Improvements” in Proc. Int’l Conf. Extending Database Technology (1996) 3–17
Zaki, M., H. Toivonen and J. Wang, “Report on BIOKDD01: Workshop on Data Mining in Bioinformatics” in SIGKDD Explorations, vol. 3, nr. 2 (2001) 71–73
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Antunes, C., Oliveira, A.L. (2003). Generalization of Pattern-Growth Methods for Sequential Pattern Mining with Gap Constraints. In: Perner, P., Rosenfeld, A. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2003. Lecture Notes in Computer Science, vol 2734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45065-3_21
Download citation
DOI: https://doi.org/10.1007/3-540-45065-3_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40504-7
Online ISBN: 978-3-540-45065-8
eBook Packages: Springer Book Archive