Skip to main content

HVSM: A New Sequential Pattern Mining Algorithm Using Bitmap Representation

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3584))

Abstract

Sequential pattern mining is an important problem for data mining with broad applications. This paper presents a first-Horizontal-last-Vertical scanning database Sequential pattern Mining algorithm (HVSM). HVSM considers a database as a vertical bitmap. The algorithm first extends itemsets horizontally, and digs out all one-large-sequence itemsets. It then extends the sequence vertically and generates candidate large sequence. The candidate large sequence is generated by taking brother-nodes as child-nodes. The algorithm counts the support by recording the first TID mark (1st-TID). Experiments show that HVSM algorithm can find frequent sequences faster than SPAM algorithm in mining the large transaction databases.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: ICDE 1995, Taipei, Taiwan (March 1995)

    Google Scholar 

  2. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.-C.: PrefixSpan mining sequential patterns efficiently by prefix projected pattern growth. In: ICDE 2001, Heidelberg, Germany, April 2001, pp. 215–226 (2001)

    Google Scholar 

  3. Garofalakis, M., Rastogi, R., Shim, K.: SPIRIT: Sequential pattern mining with regular expression constraints. In: VLDB 1999, pp. 223–234. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  4. Bettini, C., Wang, X.S., Jajodia, S.: Mining temporal relationships with multiple granularities in time sequences. Data Engineering Bulletin 21(1), 32–38 (1998)

    MathSciNet  Google Scholar 

  5. Han, J., Dong, G., Yin, Y.: Efficient mining of partial periodic patterns in time series database. In: ICDE 1999, Sydney, Australia, March 1999, pp. 106–115 (1999)

    Google Scholar 

  6. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovering frequent episodes in sequences. In: KDD 1995, Montreal, Quebec, Canada, pp. 210–215 (1995)

    Google Scholar 

  7. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of the Twentieth International Conference on Very Large Databases, Santiago, Chile, pp. 487–499 (1994)

    Google Scholar 

  8. Zaki, M.J.: Spade: An efficient algorithm for mining frequent sequences. Machine Learning 42(1/2), 31–60 (2001)

    Article  MATH  Google Scholar 

  9. Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: SIGKDD, pp. 429–435 (2002)

    Google Scholar 

  10. Song, S., ZunGuo, H., Hua Ping, H., ShiYao, J.: A sequential pattern mining algorithm for misuse intrusion detection. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds.) GCC 2004. LNCS, vol. 3252, pp. 458–465. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Song, S., Hu, H., Jin, S. (2005). HVSM: A New Sequential Pattern Mining Algorithm Using Bitmap Representation. In: Li, X., Wang, S., Dong, Z.Y. (eds) Advanced Data Mining and Applications. ADMA 2005. Lecture Notes in Computer Science(), vol 3584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527503_55

Download citation

  • DOI: https://doi.org/10.1007/11527503_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27894-8

  • Online ISBN: 978-3-540-31877-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics