Advertisement

Kernel-Tree: Mining Frequent Patterns in a Data Stream Based on Forecast Support

  • David Tse Jung Huang
  • Yun Sing Koh
  • Gillian Dobbie
  • Russel Pears
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7691)

Abstract

Although frequent pattern mining techniques have been extensively studied, the extension of their application onto data streams has been challenging. Due to data streams being continuous and unbounded, an efficient algorithm that avoids multiple scans of data is needed. In this paper we propose Kernel-Tree (KerTree), a single pass tree structured technique that mines frequent patterns in a data stream based on forecasting the support of current items in the future state. Unlike previous techniques that build a tree based on the support of items in the previous block, KerTree performs an estimation of item support in the next block and builds the tree based on the estimation. By building the tree on an estimated future state, KerTree effectively reduces the need to restructure for every block and thus results in a better performance and mines the complete set of frequent patterns from the stream while maintaining a compact structure.

Keywords

Data Streams Kernel Regression Frequent Pattern Mining 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. SIGMOD Rec. 29, 1–12 (2000)CrossRefGoogle Scholar
  2. 2.
    Tanbeer, S.K., Ahmed, C.F., Jeong, B.S., Lee, Y.K.: Efficient frequent pattern mining over data streams. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, pp. 1447–1448. ACM, NY (2008)Google Scholar
  3. 3.
    Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining frequent patterns in data streams at multiple time granularities (2002)Google Scholar
  4. 4.
    Leung, C.K.S., Khan, Q.I.: DSTree: A tree structure for the mining of frequent sets from data streams. In: Sixth International Conference on Data Mining, ICDM 2006, pp. 928–932 (December 2006)Google Scholar
  5. 5.
    Leung, C.K.S., Khan, Q.I., Li, Z., Hoque, T.: CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowl. Inf. Syst. 11, 287–311 (2007)CrossRefGoogle Scholar
  6. 6.
    Koh, Y.S., Pears, R., Dobbie, G.: Extrapolation Prefix Tree for Data Stream Mining Using a Landmark Model. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2012. LNCS, vol. 7448, pp. 340–351. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  7. 7.
    Koh, Y.S., Dobbie, G.: SPO-Tree: Efficient Single Pass Ordered Incremental Pattern Mining. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. LNCS, vol. 6862, pp. 265–276. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  8. 8.
    Engel, Y., Mannor, S., Meir, R.: The kernel recursive least-squares algorithm. IEEE Transactions on Signal Processing 52(8), 2275–2285 (2004)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13–30 (1963)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • David Tse Jung Huang
    • 1
  • Yun Sing Koh
    • 1
  • Gillian Dobbie
    • 1
  • Russel Pears
    • 2
  1. 1.Department of Computer ScienceUniversity of AucklandNew Zealand
  2. 2.School of Computing and Mathematical SciencesAUT UniversityNew Zealand

Personalised recommendations