Towards a new approach for mining frequent itemsets on data stream

Journal of Intelligent Information Systems

Volumn 28, Issue 1, 2007, Pages 23-36

  Raïssi, Chedy ^a,b   Poncelet, Pascal ^a   Teisseire, Maguelonne ^b  

^a ECOLE DES MINES D ALÈS   (France)

^b LIRMM   (France)

Author keywords

Approximate answer; Data streams; Frequent itemsets

Indexed keywords

DATA STRUCTURES; KNOWLEDGE REPRESENTATION; PROBLEM SOLVING;

APPROXIMATE ANSWER; DATA STREAMS; FREQUENT ITEMSETS;

DATA MINING;

EID: 33846965592     PISSN: 09259902     EISSN: 15737675     Source Type: Journal    
DOI: 10.1007/s10844-006-0002-3     Document Type: Article

References (12)

1. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large database. In Proceedings of the International Conference on Management of Data (ACM SIGMOD 93)(pp. 207-216). New York: ACM.
2. Chen, Y., Dong, G., Han, J., Wah, B.W., & Wang, J. (2002). Multidimensional regression analysis of time-series data streams. In VLDB Conference.
3. Chi, Y., Wang, H., Yu, P.S., & Muntz, R.R. (2004). Moment: Maintaining closed frequent itemsets over a stream sliding window. In Proceedings of International Conference on Data Missing '04 Conference (pp. 59-66).
4. Dokas, P., Ertoz, L., Kumar, V., Lazarevic, A., Srivastava, J., & Tan, P.-N. (2002). Data mining for network intrusion detection. In Proceedings of the 2002 National Science Foundation Workshop on Data Mining.
5. Giannella, G., Han, J., Pei, J., Yan, X., & Yu, P. (2003). Mining frequent patterns in data streams at multiple time granularities. In Next generation data mining. New York: MIT.
6. Han, J., Pei, J., Mortazavi-asl, B., Chen, Q., Dayal, U., & Hsu, M. (2000). Freespan: Frequent pattern-projected sequential pattern mining. In Proceedings of Knowledge Discovery and Data '00 Conference (pp. 20-23).
7. Jin, C., Qian, W., Sha, C., Yu, J.-X., & Zhou, A. (2003). Dynamically maintaining frequent items over a data stream. In Proceedings of International Conference on Information and Knowledge Management '04 Conference (pp. 287-294). Washington, District of Columbia.
8. Karp, R.-M., Shenker, S., & Papadimitriou, C.-H. (2003). A simple algorithm for rinding frequent elements in streams and bags. ACM Transactions on Database Systems, 28(1), 51-55.
9. Li, H.-F., Lee, S.Y., & Shan, M.-K. (2004). An efficient algorithm for mining frequent itemsets over the entire history of data streams. In Proceedings of the 1st International Workshop on Knowledge Discovery in Data streams.
10. Manku, G., & Motwani, R. (2002). Approximate frequency counts over data streams. In Proceedings of very Large Databases '02 Conference (pp. 346-357). Hong Kong, China.
11. Sivanandam, S.N., Sumathi, D., Hamsapriya, T., & Babu, K. (2004). In Parallel buddy prima - A hybrid parallel frequent itemset mining algorithm for very large databases. Retrieved from www.acadjournal.com.
12. Teng, W.-G., Chen, M.-S., & Yu, P.S. (2003). A regression-based temporal patterns mining schema for data streams. In Proceedings of very Large Databases '03 Conference (pp. 93-104). Berlin, Germany.