Skip to main content
SpringerLink
Log in
Book cover

Frequent Pattern Mining pp 199–224Cite as

Frequent Pattern Mining in Data Streams

  • Chapter
  • First Online:

Abstract

As the volume of digital commerce and communication has exploded, the demand for data mining of streaming data has likewise grown. One of the fundamental data mining tasks, for both static and streaming data, is frequent pattern mining. The goal of pattern mining is to identity frequently occurring patterns and structures. Such patterns may indicate scientific phenomena, economic or social trends, or even security threats. Moreover, not only is pattern discovery important by itself, but it is also a building block for machine learning tasks such as association rule induction. Traditionally, algorithms for pattern discovery have processed the entire dataset as a batch, with no restriction on how many passes through the data would be taken.

However, when the data are arriving in a continuous and unending stream, our algorithm must be limited to a single pass. Moreover, the length of the stream is indeterminate, so we cannot wait for it to end. We generate an initial result after seeing a certain quantity of data, and then we periodically revise the result. A particular challenge for frequent pattern discovery is the combinatorial explosion of candidate patterns

In this chapter, we present a structured review of online frequent pattern mining techniques. We classify the methods according to the type of pattern and data, the time window being considered, and the quality of the approximation.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   199.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of Int. conf. Very Large DataBases (VLDB'94), pages 487–499, Santiago, Chile, September 1994.

    Google Scholar 

  2. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, VLDB '94, pages 487–499, San Francisco, CA, USA, 1994. Morgan Kaufmann Publishers Inc.

    Google Scholar 

  3. Rakesh Agrawal and Ramakrishnan Srikant. Mining sequential patterns. In Data Engineering, 1995. Proceedings of the Eleventh International Conference on, pages 3–14. IEEE, 1995.

    Google Scholar 

  4. R. Agrawal, H. Mannila, R. Srikant, H. Toivonent, and A. Inkeri Verkamo. Fast discovery of association rules. In U. Fayyad and et al, editors, Advances in Knowledge Discovery and Data Mining, pages 307–328. AAAI Press, Menlo Park, CA, 1996.

    Google Scholar 

  5. Charu C. Aggarwal, Yao Li, Philip S. Yu, and Ruoming Jin. On dense pattern mining in graph streams. Proc. VLDB Endow., 3(1–2):975–984, September 2010.

    Article  Google Scholar 

  6. Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, and Setsuo Arikawa. Online algorithms for mining semi-structured data stream. In Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on, pages 27–34. IEEE, 2002.

    Google Scholar 

  7. Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, and Setsuo Arikawa. Efficient algorithms for finding frequent substructures from semi-structured data streams. In New Frontiers in Artificial Intelligence, pages 29–45. Springer, 2007.

    Google Scholar 

  8. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and Issues in Data Stream Systems. In Proceedings of the 2002 ACM Symposium on Principles of Database Systems (PODS 2002) (Invited Paper). ACM Press, June 2002.

    Google Scholar 

  9. Albert Bifet. Adaptive stream mining: Pattern learning and mining from evolving data streams. In Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams, pages 1–212, Amsterdam, The Netherlands, The Netherlands, 2010. IOS Press.

    Google Scholar 

  10. Albert Bifet and Ricard Gavaldà. Mining adaptively frequent closed unlabeled rooted trees in data streams. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '08, pages 34–42, New York, NY, USA, 2008. ACM.

    Google Scholar 

  11. Albert Bifet, Geoff Holmes, Bernhard Pfahringer, and Ricard Gavaldà. Mining frequent closed graphs on evolving data streams. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pages 591–599, New York, NY, USA, 2011. ACM.

    Google Scholar 

  12. \refauHervé Brönnimann, Bin Chen, Manoranjan Dash, Peter Haas, and Peter Scheuermann. Efficient data reduction with ease. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03, pages 59–68, New York, NY, USA, 2003. ACM.

    Google Scholar 

  13. Toon Calders, Nele Dexters, and Bart Goethals. Mining frequent itemsets in a stream. In Data Mining, 2007. ICDM 2007. Seventh IEEE International Conference on, pages 83–92. IEEE, 2007.

    Google Scholar 

  14. Joong Hyuk Chang and Won Suk Lee. Finding recent frequent itemsets adaptively over online data streams. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '03, pages 487–492, New York, NY, USA, 2003. ACM.

    Google Scholar 

  15. Joong Hyuk Chang and Won Suk Lee. Efficient mining method for retrieving sequential patterns over online data streams. J. Inf. Sci., 31(5):420–432, October 2005.

    Article  Google Scholar 

  16. Lei Chang, Tengjiao Wang, Dongqing Yang, and Hua Luan. Seqstream: Mining closed sequential patterns over stream sliding windows. In Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, ICDM '08, pages 83–92, Washington, DC, USA, 2008. IEEE Computer Society.

    Google Scholar 

  17. Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams. In Automata, Languages and Programming, pages 693–703. Springer, 2002.

    Google Scholar 

  18. Bin Chen, Peter Haas, and Peter Scheuermann. A new two-phase sampling based algorithm for discovering association rules. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '02, pages 462–468, New York, NY, USA, 2002. ACM.

    Google Scholar 

  19. Junbo Chen and ShanPing Li. Gc-tree:a fast online algorithm for mining frequent closed itemsets. In Emerging Technologies in Knowledge Discovery and Data Mining, pages 457–468. Springer, 2007.

    Google Scholar 

  20. James Cheng, Yiping Ke, and Wilfred Ng. Maintaining frequent closed itemsets over a sliding window. Journal of Intelligent Information Systems, 31(3):191–215, 2008.

    Article  Google Scholar 

  21. William Cheung and Osmar R Zaiane. Incremental mining of frequent patterns without candidate generation or support constraint. In Database Engineering and Applications Symposium, 2003. Proceedings. Seventh International, pages 111–116. IEEE, 2003.

    Google Scholar 

  22. D.W. Cheung, J. Han, V. Ng, and C.Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating techniques. In Proc. 12th IEEE International Conference on Data Engineering (ICDE-96), New Orleans, Louisiana, U.S.A., March 1, 1996.

    Google Scholar 

  23. Yun Chi, Haixun Wang, Philip S. Yu, and Richard R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. In Proceedings of the Fourth IEEE International Conference on Data Mining, ICDM '04, pages 59–66, Washington, DC, USA, 2004. IEEE Computer Society.

    Google Scholar 

  24. Graham Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. J. Algorithms, 55(1):58–75, April 2005.

    Article  MATH  MathSciNet  Google Scholar 

  25. Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro. Frequency estimation of internet packet streams with limited space. In Proceedings of the 10th Annual European Symposium on Algorithms, ESA '02, pages 348–360, London, UK, UK, 2002. Springer-Verlag.

    Google Scholar 

  26. C. I. Ezeife and Yi Lu. Mining web log sequential patterns with position coded pre-order linked wap-tree. Data Min. Knowl. Discov., 10(1):5–38, January 2005.

    Article  MathSciNet  Google Scholar 

  27. CI Ezeife and Mostafa Monwar. Ssm: a frequent sequential data stream patterns miner. In Computational Intelligence and Data Mining, 2007. CIDM 2007. IEEE Symposium on, pages 120–126. IEEE, 2007.

    Google Scholar 

  28. Chris Giannella, Jiawei Han, Jian Pei, Xifeng Yan, and Philip S Yu. Mining frequent patterns in data streams at multiple time granularities. Next generation data mining, 212:191–212, 2003.

    Google Scholar 

  29. Phillip B. Gibbons and Yossi Matias. New Sampling-Based Summary Statistics for Improving Approximate Query Answers. In Proc. of the 1998 ACM SIGMOD, pages 331–342. ACM Press, June 1998.

    Google Scholar 

  30. Bart Goethals and Mohammed J. Zaki. Workshop Report on Workshop on Frequent Itemset Mining Implementations (FIMI). 2003.

    Google Scholar 

  31. Anamika Gupta, Vasudha Bhatnagar, and Naveen Kumar. Mining closed itemsets in data stream using formal concept analysis. In Proceedings of the 12th international conference on Data warehousing and knowledge discovery, DaWaK'10, pages 285–296, Berlin, Heidelberg, 2010. Springer-Verlag.

    Google Scholar 

  32. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD Conference on Management of Data, 2000.

    Google Scholar 

  33. Jiawei Han, Hong Cheng, Dong Xin, and Xifeng Yan. Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery, 15(1):55–86, 2007.

    Article  MathSciNet  Google Scholar 

  34. Chandima HewaNadungodage, Yuni Xia, Jaehwan John Lee, and Yi-cheng Tu. Hyper-structure mining of frequent patterns in uncertain data streams. Knowledge and Information Systems, 37(1):219–244, 2013.

    Article  Google Scholar 

  35. C. Hidber. Online Association Rule Mining. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 145–156. ACM Press, 1999.

    Google Scholar 

  36. Jochen Hipp, Ulrich Güntzer, and Gholamreza Nakhaeizadeh. Algorithms for association rule mining—a general survey and comparison. SIGKDD Explor. Newsl., 2(1):58–64, June 2000.

    Google Scholar 

  37. Jun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan Prins, and Alexander Tropsha. Mining protein family-specific residue packing patterns from protein structure graphs. In Eighth International Conference on Research in Computational Molecular Biology (RECOMB), pages 308–315, 2004.

    Google Scholar 

  38. Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Principles of Knowledge Discovery and Data Mining (PKDD2000), pages 13–23, 2000.

    Google Scholar 

  39. Nan Jiang and Le Gruenwald. Cfi-stream: mining closed frequent itemsets in data streams. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '06, pages 592–597, New York, NY, USA, 2006. ACM.

    Google Scholar 

  40. Ruoming Jin and Gagan Agrawal. An algorithm for in-core frequent itemset mining on streaming data. In Proceedings of the Fifth IEEE International Conference on Data Mining, ICDM '05, pages 210–217, Washington, DC, USA, 2005. IEEE Computer Society.

    Google Scholar 

  41. Ruoming Jin, Chao Wang, Dmitrii Polshakov, Srini Parthasarathy, and Gagan Agrawal. Discovering frequent topological structures from graph datasets. In KDD, 2005.

    Google Scholar 

  42. Richard M. Karp, Christos H. Papadimitrious, and Scott Shanker. A Simple Algorithm for Finding Frequent Elements in Streams and Bags. Available from http://www.cs.berkeley.edu/christos/iceberg.ps, 2002.

  43. Adam Koper and Hung Son Nguyen. Sequential pattern mining from stream data. In Advanced Data Mining and Applications, pages 278–291. Springer, 2011.

    Google Scholar 

  44. Michihiro Kuramochi and George Karypis. Frequent subgraph discovery. In ICDM '01: Proceedings of the 2001 IEEE International Conference on Data Mining, pages 313–320, 2001.

    Google Scholar 

  45. Daesu Lee and Wonsuk Lee. Finding maximal frequent itemsets over online data streams adaptively. In Data Mining, Fifth IEEE International Conference on, pages 8–pp. IEEE, 2005.

    Google Scholar 

  46. CK-S Leung and Boyu Hao. Mining of frequent itemsets from streams of uncertain data. In Data Engineering, 2009. ICDE'09. IEEE 25th International Conference on, pages 1663–1670. IEEE, 2009.

    Google Scholar 

  47. Carson Kai-Sang Leung and Fan Jiang. Frequent itemset mining of uncertain data streams using the damped window model. In Proceedings of the 2011 ACM Symposium on Applied Computing, SAC '11, pages 950–955, New York, NY, USA, 2011. ACM.

    Google Scholar 

  48. Carson Kai-Sang Leung and Fan Jiang. Frequent pattern mining from time-fading streams of uncertain data. In Data Warehousing and Knowledge Discovery, pages 252–264. Springer, 2011.

    Google Scholar 

  49. Hua-Fu Li and Suh-Yin Lee. Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Systems with Applications, 36(2):1466–1477, 2009.

    Article  Google Scholar 

  50. Haifeng Li and Ning Zhang. A false negative maximal frequent itemset mining algorithm over stream. In Advanced Data Mining and Applications, pages 29–41. Springer, 2011.

    Google Scholar 

  51. Wenmin Li, Jiawei Han, and Jian Pei. Cmar: Accurate and efficient classification based on multiple class-association rules. In Proceedings of the 2001 IEEE International Conference on Data Mining, ICDM '01, pages 369–376, Washington, DC, USA, 2001. IEEE Computer Society.

    Google Scholar 

  52. Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. An efficient algorithm for mining frequent itemsets over the entire history of data streams. In Proc. of First International Workshop on Knowledge Discovery in Data Streams, 2004.

    Google Scholar 

  53. Hua-Fu Li, Suh-Yin Lee, and Man-Kwan Shan. Online mining (recently) maximal frequent itemsets over data streams. In Research Issues in Data Engineering: Stream Data Mining and Applications, 2005. RIDE-SDMA 2005. 15th International Workshop on, pages 11–18. IEEE, 2005.

    Google Scholar 

  54. Hua-Fu Li, Man-Kwan Shan, and Suh-Yin Lee. Online mining of frequent query trees over xml data streams. In Proceedings of the 15th international conference on World Wide Web, pages 959–960. ACM, 2006.

    Google Scholar 

  55. Hua-Fu Li, Man-Kwan Shan, and Suh-Yin Lee. Dsm-fi: an efficient algorithm for mining frequent itemsets in data streams. Knowledge and Information Systems, 17(1):79–97, 2008.

    Article  Google Scholar 

  56. Hua-Fu Li, Chin-Chuan Ho, and Suh-Yin Lee. Incremental updates of closed frequent itemsets over continuous data streams. Expert Systems with Applications, 36(2):2451–2458, 2009.

    Article  Google Scholar 

  57. Haifeng Li, Ning Zhang, and Zhixin Chen. A simple but effective maximal frequent itemset mining algorithm over streams. Journal of Software, 7(1):25–32, 2012.

    Google Scholar 

  58. Chih-Hsiang Lin, Ding-Ying Chiu, Yi-Hung Wu, and Arbee L.P. Chen. Mining frequent itemsets from data streams with a time-sensitive sliding window. In Proceedings of the Fifth SIAM International Conference on Data Mining, volume 119, page 68. SIAM, 2005.

    Google Scholar 

  59. Xuejun Liu, Jihong Guan, and Ping Hu. Mining frequent closed itemsets from a landmark window over online data streams. Comput. Math. Appl., 57(6):927–936, March 2009.

    Article  MATH  Google Scholar 

  60. G. S. Manku and R. Motwani. Approximate Frequency Counts Over Data Streams. In Proceedings of Conference on Very Large DataBases (VLDB), pages 346–357, September 2002.

    Google Scholar 

  61. Gurmeet Singh Manku and Rajeev Motwani. Approximate frequency counts over data streams. In Proceedings of the 28th international conference on Very Large Data Bases, VLDB '02, pages 346–357. VLDB Endowment, 2002.

    Google Scholar 

  62. Alice Marascu and Florent Masseglia. Mining sequential patterns from data streams: A centroid approach. J. Intell. Inf. Syst., 27(3):291–307, November 2006.

    Article  Google Scholar 

  63. Guojun Mao, Xindong Wu, Xingquan Zhu, Gong Chen, and Chunnian Liu. Mining maximal frequent itemsets from data streams. Journal of Information Science, 33(3):251–262, 2007.

    Article  Google Scholar 

  64. Luiz F. Mendes, Bolin Ding, and Jiawei Han. Stream sequential pattern mining with precise error bounds. In Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, ICDM '08, pages 941–946, Washington, DC, USA, 2008. IEEE Computer Society.

    Google Scholar 

  65. Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Efficient computation of frequent and top-k elements in data streams. In Proceedings of the 10th International Conference on Database Theory, ICDT'05, pages 398–412, Berlin, Heidelberg, 2005. Springer-Verlag.

    Google Scholar 

  66. Jayadev Misra and David Gries. Finding repeated elements. Technical report, Cornell University, Ithaca, NY, USA, 1982.

    Google Scholar 

  67. Willie Ng and Manoranjan Dash. Efficient approximate mining of frequent patterns over transactional data streams. In Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery, DaWaK '08, pages 241–250, Berlin, Heidelberg, 2008. Springer-Verlag.

    Google Scholar 

  68. Debprakash Patnaik, Srivatsan Laxman, Badrish Chandramouli, and Naren Ramakrishnan. A general streaming algorithm for pattern discovery. Knowledge and Information Systems, pages 1–26, 2013.

    Google Scholar 

  69. Chedy Raïssi, Pascal Poncelet, and Maguelonne Teisseire. Need for SPEED: Mining sequential patterns in data streams. BDA'05: Bases de données Avanées Actes, 2005.

    Google Scholar 

  70. Chedy Raïssi, Pascal Poncelet, and Maguelonne Teisseire. Towards a new approach for mining frequent itemsets on data stream. Journal of Intelligent Information Systems, 28(1):23–36, 2007.

    Article  Google Scholar 

  71. Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, and Young-Koo Lee. Sliding window-based frequent pattern mining over data streams. Information sciences, 179(22):3843–3865, 2009.

    Article  MathSciNet  Google Scholar 

  72. Wei-Guang Teng, Ming-Syan Chen, and Philip S. Yu. A regression-based temporal pattern mining scheme for data streams. In Proceedings of the 29th international conference on Very large data bases-Volume 29, VLDB '03, pages 93–104. VLDB Endowment, 2003.

    Google Scholar 

  73. H. Toivonen. Sampling large databases for association rules. In Proc. of the 22nd VLDM Conference., 1996.

    Google Scholar 

  74. Raymond Chi-Wing Wong and Ada Wai-Chee Fu. Mining top-k frequent itemsets from data streams. Data Mining and Knowledge Discovery, 13(2):193–217, 2006.

    Article  MathSciNet  Google Scholar 

  75. Dong Xin, Jiawei Han, Xifeng Yan, and Hong Cheng. Mining compressed frequent-pattern sets. In VLDB, 2005.

    Google Scholar 

  76. Xifeng Yan and Jiawei Han. gspan: Graph-based substructure pattern mining. In ICDM '02: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), page 721, 2002.

    Google Scholar 

  77. Jeffery Xu Yu, Zhihong Chong, Hongjun Lu, and Aoying Zhou.Li False positive or false negative: mining frequent itemsets from high speed transactional data streams. In Proceedings of the Thirtieth international conference on Very large data bases-Volume 30, VLDB '04, pages 204–215. VLDB Endowment, 2004.

    Google Scholar 

  78. Mohammed J. Zaki. Efficiently mining frequent trees in a forest. In KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 71–80, 2002.

    Google Scholar 

  79. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In 3rd Intl. Conf. on Knowledge Discovery and Data Mining., August 1997.

    Google Scholar 

  80. Mohammed J. Zaki and Charu C. Aggarwal. Xrules: an effective structural classifier for xml data. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 316–325, 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. John Carroll University, University Heights, OH, USA

    Victor E. Lee

  2. Kent State University, Kent, OH, US

    Ruoming Jin

  3. Ohio State University, Columbus, OH, US

    Gagan Agrawal

Authors
  1. Victor E. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ruoming Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gagan Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Victor E. Lee .

Editor information

Editors and Affiliations

  1. IBM, Yorktown Heights, New York, USA

    Charu C. Aggarwal

  2. University of Illinois at Urbana-Champaign, Urbana, Illinois, USA

    Jiawei Han

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Lee, V., Jin, R., Agrawal, G. (2014). Frequent Pattern Mining in Data Streams. In: Aggarwal, C., Han, J. (eds) Frequent Pattern Mining. Springer, Cham. https://doi.org/10.1007/978-3-319-07821-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07821-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07820-5

  • Online ISBN: 978-3-319-07821-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation