Moment: Maintaining closed frequent itemsets over a stream sliding window

Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Volumn , Issue , 2004, Pages 59-66

  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

[No Author keywords available]

Indexed keywords

CLOSED ENUMERATION TREE (CET); DATA DISTRIBUTION; DATA STREAMS; ITEMSETS;

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; PROBABILITY; PROBLEM SOLVING; TREES (MATHEMATICS);

DATA MINING;

EID: 19544377965     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. C. Agarwal, C. C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm for generation of frequent item sets. Journal of Parallel and Distributed Computing, 61(3):350-371, 2001.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th Intl. Conf. on Very Large Databases (VLDB'94), 1994.
3. T. Asai, H. Arimura, K. Abe, S. Kawasoe, and S. Arikawa. Online algorithms for mining semi-structured data stream. In Proc. 2002 Int. Conf. on Data Mining (ICDM'02), 2002.
4. R. J. Bayardo, Jr. Efficiently mining long patterns from databases. In Proceedings of the ACM SIGMOD, 1998.
5. J. H. Chang and W. S. Lee. Finding recent frequent itemsets adaptively over online data streams. In Proc. of the 2003 Int. Conf. Knowledge Discovery and Data Mining (SIGKDD'03), 2003.
6. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proc. of the 29th Int'l Colloquium on Automata, Languages and Programming, 2002.
7. D. W. Cheung, J. Han, V. Ng, and C. Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In Proceedings of the Twelfth International Conference on Data Engineering, 1996.
8. D. W. Cheung, S. D. Lee, and B. Kao. A general incremental technique for maintaining discovered association rules. In Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA), 1997.
9. Y. Chi, H. Wang, P. S. Yu, and R. R. Muntz. Catch the moment: Maintaining closed frequent itemsets over a data stream sliding window. Technical Report, IBM, 2004.
10. C. Giannella, J. Han, E. Robertson, and C. Liu. Mining frequent itemsets over arbitrary time intervals in data streams. Technical Report tr587, Indiana University, 2003.
11. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In Proceedings of the 2001 IEEE Int'l Conf. on Data Mining, 2001.
12. C. Hidber. Online association rule mining. In Proc. of the ACM SIGMOD int'l conf. on Management of data, 1999.
13. C. Lee, C. Lin, and M. Chen. Slidmg-window filtering: an efficient algorithm for incremental mining. In Proc. of the int'l conf. on Info. and knowledge management, 2001.
14. G. Manku and R. Motwani. Approximate frequency counts over data streams. In Proceedings of the 28th International Conference on Very Large Data Bases, 2002.
15. W.-G. Teng, M.-S. Chen, and P. S. Yu. A regression-based temporal pattern mining scheme for data streams. In Proceedings of 29th International Conference on Very Large Data Bases (VLDB'03), 2003.
16. J. Wang, J. Han, and J. Pei. Closet+: searching for the best strategies for mining frequent closed itemsets. In Proc. of the 2003 Int. Conf. Knowledge Discovery and Data Mining (SIGKDD'03), 2003.
17. M. J. Zaki and C. Hsiao. Charm: An efficient algorithm for closed itemset mining. In 2nd SIAM Int'l Conf. on Data Mining, 2002.
18. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In Proc. of the 2001 Int. Conf. Knowledge Discovery and Data Mining (SIGKDD'01), 2001.