Catch the moment: Maintaining closed frequent itemsets over a data stream sliding window

Knowledge and Information Systems

Volumn 10, Issue 3, 2006, Pages 265-294

  Chi, Yun ^a   Wang, Haixun ^b   Yu, Philip S ^b   Muntz, Richard R ^a  

^a University of California   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Closed frequent itemset; Data streams; Incremental learning; Sliding window

Indexed keywords

DATA STRUCTURES; MONITORING; TREES (MATHEMATICS);

BOUNDARY MOVEMENT; CLOSED ENUMERATION TREES; CLOSED FREQUENT ITEMSET; CLOSED FREQUENT ITEMSETS; COMPACT DATA STRUCTURE; INCREMENTAL LEARNING; MEMORY CONSTRAINTS; SLIDING WINDOW;

DATA STREAMS;

EID: 33749322733     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-006-0003-0     Document Type: Article

References (22)

1. Agarwal RC, Aggarwal CC, Prasad VVV (2001) A tree projection algorithm for generation of frequent item sets. J Parallel Distrib Comput 61(3):350-371
2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large databases (VLDB'94)
3. Asai T, Arimura H, Abe K, Kawasoe S, Arikawa S (2002) Online algorithms for mining semi-structured data stream. In: Proceedings of the 2002 international conference on data mining (ICDM'02)
4. Bayardo Jr RJ (1998) Efficiently mining long patterns from databases. In: Proceedings of the ACM SIGMOD
5. Chang JH, Lee WS (2003) Finding recent frequent itemsets adaptively over online data streams. In: Proceedings of the 2003 international conference knowledge discovery and data mining (SIGKDD'03)
6. Charikar M, Chen K, Farach-Colton M (2002) Finding frequent items in data streams. In: Proceedings of the 29th international colloquium on automata, languages and programming
7. Cheung DW, Han J, Ng V, Wong CY (1996) Maintenance of discovered association rules in large databases: An incremental updating technique. In: Proceedings of the twelfth international conference on data engineering
8. Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules, In: Proceedings of the fifth international conference on database systems for advanced applications (DASFAA)
9. Giannella C, Han J, Robertson E, Liu C (2003) Mining frequent itemsets over arbitrary time intervals in data streams. Technical Report tr587, Indiana University
10. Gouda K, Zaki MJ (2001) Efficiently mining maximal frequent itemsets. In: Proceedings of the 2001 IEEE international conference on data mining
11. Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data
12. Hidber C (1999) Online association rule mining. In: Proceedings of the ACM SIGMOD international conference on management of data
13. Manku G, Motwani R (2002) Approximate frequency counts over data streams. In: Proceedings of the 28th international conference on very large data bases
14. Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data Mining Knowledge Discov 1(3):241-258
15. Otey ME, Parthasarathy S, Wang C, Veloso A, Meira W Jr (2004) Parallel and distributed methods for incremental frequent itemset mining. IEEE Trans Syst Man Cybern, Part B 34(6):2439-2450
16. Teng W-G, Chen M-S, Yu PS (2003) A regression-based temporal pattern mining scheme for data streams. In: Proceedings of 29th international conference on very large data bases (VLDB'03)
17. Thomas S, Bodagala S, Alsabti K, Ranka S (1997) An efficient algorithm for the incremental updation of association rules in large databases. In: Proceedings of the 1997 international conference knowledge discovery and data mining (SIGKDD'97), pp 263-266
18. Veloso A, Meira Jr W, de Carvalho M, Pôssas B, Parthasarathy S, Zaki MJ (2002) Mining frequent itemsets in evolving databases. In: Proceedings of the SDM
19. Vitter JS (1985) Random sampling with a reservoir. ACM Trans Math Softw 11(1)
20. Wang J, Han J, Pei J (2003) Closet+: Searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the 2003 international conference knowledge discovery and data mining (SIGKDD'03)
21. Zaki MJ, Hsiao C (2002) Charm: An efficient algorithm for closed itemset mining. In: Proceedings of the 2nd SIAM international conference on data mining
22. Zheng Z, Kohavi R, Mason L (2001) Real world performance of association rule algorithms. In: Proceedings of the 2001 international conference on knowledge discovery and data mining (SIGKDD'01)