CLAIM: An efficient method for relaxed frequent closed itemsets mining over stream data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4443 LNCS, Issue , 2007, Pages 664-675

  Song, Guojie ^a   Yang, Dongqing ^a   Cui, Bin ^a   Zheng, Baihua ^b   Liu, Yunfeng ^a   Xie, Kunqing ^a  

^a PEKING UNIVERSITY   (China)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATA ACQUISITION; MATHEMATICAL MODELS;

DATA STREAM; RELAXED FREQUENT CLOSED ITEMSETS;

DATA MINING;

EID: 38049139142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71703-4_56     Document Type: Conference Paper

References (13)

1. Jeffrey Xu Yu, Zhihong Chong, Hongjun Lu, Aoying Zhou. False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams. In Proc. of the 28th Intl. Conf. on Very Large Data Bases, pages 204-215, 2004.
2. Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han. On Computing Condensed Frequent Pattern Bases. In Proc. of IEEE Intl. Conf. on Data Mining, pages 378-385, 2002.
3. J. H. Chang and W. S. Lee. Finding recent frequent itemsets adaptively over online data streams. In Proc. of the 9th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, pages 487-492, 2003.
4. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proc. of the 29th Intl Colloquium on Automata, Languages and Programming, 2002.
5. G. Manku and R. Motwani. Approximate frequency counts over data streams. In Proc. of the 28th Intl. Conf. on Very Large Data Bases, pages 346-357, 2002.
6. 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.
7. G. Cormode, S. Muthukrishnan, What's Hot and What's Not: Tracking Most Frequent Items Dynamically, In the ACM Symposium on Principles of Database Systems, pages 296-306, 2003.
8. Richard M. Karp, Scott Shenker, A Simple Algorithm for Finding Frequent Elements in Streams and Bags, In the ACM Transactions on Database Systems, 28(1):51-55, 2003.
9. J. Han, J. Pei, and Y. Yin. Mining frequent itemsets without candidate generation. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Database, pages 1-12, 2000.
10. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In Proc. of the 2001 IEEE Intl. Conf. on Data Mining, pages 163-170, 2001.
11. J. Wang, J. Han, and J. Pei. Closet+: searching for the best strategies for mining frequent closed itemsets. In Proc. of the Intl. Conf. Knowledge Discovery and Data Mining, pages 236-245, 2003.
12. Y. Chi, H. Wang, P. Yu, and R. Muntz, MOMENT: Maintaining closed frequent itemsets over a stream sliding window. In Proc. Of 4th IEEE Intl. Conf. on Data Mining, pages 59-66, 2004.
13. B. Bloom. Space/time tradeoffs in in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.