Advertisement

Search Method of Time Sensitive Frequent Itemsets in Data Streams

  • Tae-Su Park
  • Ju-Hong Lee
  • Sang-Ho Park
  • Bumghi Choi
  • Deok-Hwan Kim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4225)

Abstract

Recently, due to technical improvements of storage devices and networks, the amount of data increases rapidly. In addition, it is required to find the knowledge embedded in a data stream as fast as possible. Data stream is influenced by time. Therefore, the itemsets which were not the frequent itemsets can become frequent itemsets. The volume of data stream is so large that it can hardly be stored in finite memory space. Current researches do not offer appropriate method to find frequent itemsets in which flow of time is reflected but provide only frequent items using total aggregation values. In this paper we propose a novel algorithm for finding the relative frequent itemsets according to the time in a data stream. We also propose a method to save frequent items and sub-frequent items in order to take limited memory into account and a method to update time variant frequent items. By applying the proposed technique, we can improve the accuracy of searching for a change in the frequent itemsets according to the time in a data stream. Moreover, it will be able to use the limited memory space efficiently and store all frequent itemsets.

Keywords

Data Stream Frequent Itemsets Data Mining 

References

  1. 1.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th Intl. Conf. on Very Large Databases (1994)Google Scholar
  2. 2.
    Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. of SIGMOD/PODS, Madison, Wisconsin, USA, pp. 1–16 (2002)Google Scholar
  3. 3.
    Chang, J., Lee, W.: Finding recent frequent itemsets adaptively over online data Streams. In: Proc. of the 9th ACM SIGKDD Intl. Conf. on Knowledge Discovery & Data Mining, Washington, DC, pp. 226–235 (2003)Google Scholar
  4. 4.
    Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Procedings of the International Colloquium on Automata, Languages and Programming, pp. 693–703 (2002)Google Scholar
  5. 5.
    Cheng, J., Ke, Y., Ng, W.: Maintaining Frequent Itemsets over High-Speed Data Streams. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Chi, Y., Wang, H., Yu, P., Muntz, R.: MOMENT: Maintaining closed frequent itemsets over a stream sliding window. In: Proc. of 4th IEEE Intl. Conf. on Data Mining, Brighton, UK, pp. 59–66 (2004)Google Scholar
  7. 7.
    Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining Frequent Patterns in Data Streams at Multiple Time Granularities. In: Kargupta, H., Joshi, A., Sivakumar, K., Yesha, Y. (eds.) Next Generation Data Mining, AAAI/MIT (2003)Google Scholar
  8. 8.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the SIGMOD Conference, Dallas, Texas, USA, pp. 1–12. ACM Press, New York (2000)CrossRefGoogle Scholar
  9. 9.
    Manku, G., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of 28th International Conference on Very Large Data Bases, pp. 346–357 (2002)Google Scholar
  10. 10.
    Yu, J.X., Chong, Z., Lu, H., Zhou, A.: False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams. In: VLDB 2004, pp. 204–215 (2004)Google Scholar
  11. 11.
    Zhang, D., Gunopulos, D., Tsotras, V.J., Seeger, B.: Temporal Aggregation over Data Streams using Multiple Granlarities. In: Jensen, C.S., Jeffery, K.G., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Tae-Su Park
    • 1
  • Ju-Hong Lee
    • 1
  • Sang-Ho Park
    • 1
  • Bumghi Choi
    • 1
  • Deok-Hwan Kim
    • 2
  1. 1.Dept. of Computer Science & Information EngineeringInha UniversityIncheonKorea
  2. 2.Dept. of Electronics EngineeringInha University 

Personalised recommendations