Skip to main content
SpringerLink
Log in

Mining Long Patterns of Least-Support Items in Stream

  • Conference paper
  • First Online:
Intelligent Computing Theories and Methodologies (ICIC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9226))

Included in the following conference series:

  • 1499 Accesses

Abstract

The mining task of finding long sequential pattern has been well studied for years. Typical algorithms often apply vary cascading support counting methods, including the basic apriori algorithm, FP-growth, and other derived algorithms. It is commonly known that during the mining process the items with very high support may lead to poor time performance and very huge useless branch search space, especially when the items in fact are not the member of the end long pattern. On the other hand the items with least user specified support, but will be the member of long pattern, might be discarded easily. This problem could be more challenging in scenarios where the data source is stream data, for data stream being unbounded, time-varied and un-revisited. We carefully considered the role of hidden Markov chain structure and then checked the item frequency evolution in stream mining context. In this paper we presented a method of mining long patterns for data stream application scenarios. Our algorithm can well overcome the negative effects generated in stream scenarios.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the Eleventh International Conference on Data Engineering, pp. 3–14. IEEE Computer Society Press (1995)

    Google Scholar 

  2. Srikant, R., Agrawal, R.: Mining sequential patterns: generalizations and performance improvements. In: Apers, P.M., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)

    Google Scholar 

  3. Masseglia, F., Cathala, F., Poncelet, P.: The PSP approach for mining sequential patterns. In: Żytkow, J.M. (ed.) PKDD 1998. LNCS, vol. 1510, pp. 176–184. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H.: Prefixspan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the 17th International Conference on Data Engineering (ICDE 2001), pp. 215–226 (2001)

    Google Scholar 

  5. Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM-SiGMOD International Conference Management of Data (SIGMOD 2000), pp. 1–12 (2000)

    Google Scholar 

  6. Han, J., Pei, J., Mortazavi-Asl, B., Chen, Q.: FreeSpan: frequent pattern-projected sequential pattern mining. In: Proceedings of the 2000 International Conference Knowledge Discovery and Data Mining (KDD’00), pp. 355–359. Boston, MA (2000)

    Google Scholar 

  7. Zaki, M.J.: Spade: an efficient algorithm for mining frequents sequences. Mach. Learn. 42, 31–60 (2001)

    Article  MATH  Google Scholar 

  8. Ayres, J., Gehrke, J., Yiu, T., Flannick, J.: Sequential pattern mining using a bitmap representation. In: SIGKDD 2001, Edmonton, Alberta, Canada (2001)

    Google Scholar 

  9. Zhu, F., Yan, X., Han, J., Yu, P.S., Cheng, H.: Mining colossal frequent patterns by core pattern fusion. In Proceedings of the International Conference Data Engineering (ICDE) (2007)

    Google Scholar 

  10. Rabiner, L.R.: Proc. IEEE 77(2), 257–286 (1989)

    Article  MATH  Google Scholar 

  11. Panuccio, A., Bicego, M., Murino, V.: A hidden Markov model-based approach to sequential data clustering. In: Caelli, T.M., Amin, A., Duin, R.P., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol. 2396, pp. 734–743. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining frequent patterns in data streams at multiple time granularities. In: Kargupta, H., et al. (eds.) Data Mining: Next Generation Challenges and Future Directions. MIT Press, Cambridge (2003). Ch. 3

    Google Scholar 

  13. www.almaden.ibm.com/cs/quest/syndata.html/#assocSynData

Download references

Author information

Authors and Affiliations

  1. Modern Education Technique Center, Shanghai University of Political Science and Law, Shanghai, 201701, China

    Qinhua Huang & Weimin Ouyang

Authors
  1. Qinhua Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weimin Ouyang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qinhua Huang .

Editor information

Editors and Affiliations

  1. Tongji University, Shanghai, China

    De-Shuang Huang

  2. University of Ulsan, Ulsan, Korea (Republic of)

    Kang-Hyun Jo

  3. Liverpool John Moores University, Liverpool, United Kingdom

    Abir Hussain

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Huang, Q., Ouyang, W. (2015). Mining Long Patterns of Least-Support Items in Stream. In: Huang, DS., Jo, KH., Hussain, A. (eds) Intelligent Computing Theories and Methodologies. ICIC 2015. Lecture Notes in Computer Science(), vol 9226. Springer, Cham. https://doi.org/10.1007/978-3-319-22186-1_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22186-1_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22185-4

  • Online ISBN: 978-3-319-22186-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation