Skip to main content

Efficient Mining Regularly Frequent Patterns in Transactional Databases

  • Conference paper

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

Abstract

Finding interesting patterns plays an important role in several data mining applications, such as market basket analysis, medical data analysis, and others. The occurrence frequency of patterns has been regarded as an important criterion for measuring interestingness of a pattern in several applications. However, temporal regularity of patterns can be considered as another important measure for some applications. In this paper, we propose an efficient approach for miming regularly frequent patterns. As for temporal regularity measure, we use variance of interval time between pattern occurrences. To find regularly frequent patterns, we utilize pattern-growth approach according to user given min_support and max_variance threshold. Extensive performance study shows that our approach is time and memory efficient in finding regularly frequent patterns.

Keywords

  • Data mining
  • interesting pattern
  • frequent pattern
  • regularly frequent pattern

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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., Imielinski, T., Swami, A.N.: Mining Association Rules Between Sets of Items in Large Databases. In: ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  2. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: ACM International Conference on Management of Data, pp. 1–12 (2000)

    Google Scholar 

  3. Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: RP-Tree: A Tree Structure to Discover Regular Patterns in Transactional Database. In: Fyfe, C., Kim, D., Lee, S.-Y., Yin, H. (eds.) IDEAL 2008. LNCS, vol. 5326, pp. 193–200. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  4. Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Catch the Moment: Maintaining Closed Frequent Itemsets Over a Data Stream Sliding Window. Knowledge and Information System 10(3), 265–294 (2006)

    CrossRef  Google Scholar 

  5. Zaki, M.J., Hsiao, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering 17(4), 462–478 (2005)

    CrossRef  Google Scholar 

  6. Huang, Y., Xiong, H., Wu, W., Deng, P., Zhang, Z.: Mining maximal hyperclique pattern: A hybrid serach stategy. Information Sciences 177, 703–721 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Minh, Q.T., Oyanagi, S., Yamazaki, K.: Mining the K-Most Interesting Frequent Patterns Sequentially. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 620–628. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  8. Wang, H., Perng, C.-S., Ma, S., Yu, P.S.: Demand-driven frequent itemset mining using pattern structures. Knowledge and Information Systems 8, 82–102 (2005)

    CrossRef  Google Scholar 

  9. Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Efficient Single-Pass Frequent Pattern Mining using a prefix-tree. Information Sciences 179, 559–583 (2009)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Discovering Periodic-Frequent Patterns in Transactional Databases. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS (LNAI), vol. 5476, pp. 242–253. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  11. Elfeky, M.G., Aref, W.G., Elmagarmid, A.K.: Periodicity detection in time series databases. IEEE Transactions on Knowledge and Data Engineering 17(7), 875–887 (2005)

    CrossRef  Google Scholar 

  12. Han, J., Dong, G., Yin, Y.: Efficient mining of partial periodic patterns in time series database. In: Proceedings of 15th International Conference on Data Engineering, pp. 106–115 (1999)

    Google Scholar 

  13. Ozden, B., Ramaswamy, S., Silberschatz, A.: Cyclic Association Rules. In: 14th International Conference on Data Engineering, pp. 412–421 (1998)

    Google Scholar 

  14. Toroslu, I.H., Kantarcıoǧlu, M.: Mining Cyclically Repeated Patterns. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol. 2114, pp. 83–92. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rashid, M.M., Karim, M.R., Jeong, BS., Choi, HJ. (2012). Efficient Mining Regularly Frequent Patterns in Transactional Databases. In: Lee, Sg., Peng, Z., Zhou, X., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29038-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29038-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29037-4

  • Online ISBN: 978-3-642-29038-1

  • eBook Packages: Computer ScienceComputer Science (R0)