Abstract
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm was proposed in SIGKDD’2002, which utilized a depth-first traversal on the search space combined with a vertical bitmap representation to provide efficient support counting. According to its experimental results, SPAM outperformed the previous works SPADE and PrefixSpan algorithms on large datasets. However, the SPAM algorithm is efficient under the assumption that a huge amount of main memory is available such that its practicability is in question. In this paper, an Improved-version of SPAM algorithm, called I-SPAM, is proposed. By extending the structures of data representation, several heuristic mechanisms are proposed to speed up the efficiency of support counting further. Moreover, the required memory size for storing temporal data during mining process of our method is less than the one needed by SPAM. The experimental results show that I-SPAM can achieve the same magnitude efficiency and even better than SPAM on execution time under about half the maximum memory requirement of SPAM.
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
Agarwal, R., Srikant, R.: Fast Algorithm for Mining Association Rule in Large Databases. In: Proc. 1994 Int. Conf. Very Large DataBases, pp. 487–499 (1994)
Agarwal, R., Srikant, R.: Mining Sequential Pattern. In: Proc. 1995 Int. Conf. Data Engineering, pp. 3–10 (1995)
Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential PAttern Mining Using A Bitmap Representation. In: Proc. 2002 Int. Conf. Knowledge Discovery and Data Mining (2002)
Pei, J., Han, J., Chen, Q., Dayal, U., Pinto, H.: FreeSpan: Frequent Pattern-Projected Sequential Pattern Mining. In: Proc. 2000 Int. Conf. Knowledge Discovery and Data Mining (2000)
Pei, J., Han, J., Mortazavi-Asi, B., Pinto, H.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In: Proc. 2001 Int. Conf. on Data Engineering (2001)
Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057. Springer, Heidelberg (1996)
Zaki, M.J.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning Journal 42(1/2), 31–60 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, CL., Koh, JL., An, PY. (2005). Improved Sequential Pattern Mining Using an Extended Bitmap Representation. In: Andersen, K.V., Debenham, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2005. Lecture Notes in Computer Science, vol 3588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546924_76
Download citation
DOI: https://doi.org/10.1007/11546924_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28566-3
Online ISBN: 978-3-540-31729-6
eBook Packages: Computer ScienceComputer Science (R0)