Skip to main content

Mining Frequent Ordered Patterns

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2005)

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

Included in the following conference series:

Abstract

Mining frequent patterns has been studied popularly in data mining research. All of previous studies assume that items in a pattern are unordered. However, the order existing between items must be considered in some applications. In this paper, we first give the formal model of ordered patterns and discuss the problem of mining frequent ordered patterns. Base on our analyses, we present two efficient algorithms for mining frequent ordered patterns. We also present results of applying these algorithms to a synthetic data set, which show the effectiveness of our algorithms.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brin, S., Motwani, R., Silverstein, C.: Beyond market basket: Generatalizing association rules to correlations. In: SIGMOD 1997, pp. 265–276 (1997)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE 1995, pp. 3–14 (1995)

    Google Scholar 

  3. Han, J., Dong, G., Yin, Y.: Efficient mining of partical periodic patterns in time series database. In: ICDE 1999, pp. 106–115 (1999)

    Google Scholar 

  4. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Set of Items in Large Databases. In: SIGMOD 1993, pp. 207–216 (1993)

    Google Scholar 

  5. Agrawal, R., Srikant, R.: Fast algorithm for mining Association rules. In: VLDB 1994, pp. 487–499 (1994)

    Google Scholar 

  6. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000, pp. 1–12 (2000)

    Google Scholar 

  7. Zaki, M.J.: Scalable algorithms for association mining. IEEE TKDE 12(3), 372–390 (2000)

    MathSciNet  Google Scholar 

  8. Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE 1995, pp. 3–14 (1995)

    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

Deng, ZH., Ji, CR., Zhang, M., Tang, SW. (2005). Mining Frequent Ordered Patterns. In: Ho, T.B., Cheung, D., Liu, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2005. Lecture Notes in Computer Science(), vol 3518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11430919_19

Download citation

  • DOI: https://doi.org/10.1007/11430919_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26076-9

  • Online ISBN: 978-3-540-31935-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics