False-negative frequent items mining from data streams with bursting

Lecture Notes in Computer Science

Volumn 3453, Issue , 2005, Pages 422-434

  Chong, Zhihong ^a   Yu, Jeffrey Xu ^b   Lu, Hongjun ^c   Zhang, Zhengjie ^a   Zhou, Aoying ^a  

^a FUDAN UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; OPTIMIZATION; RELIABILITY;

BURSTING; DATA STREAMS; FALSE-NEGATIVE FREQUENCY ITEMS; RELIABILITY PARAMETERS;

DATA MINING;

EID: 24644440655     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11408079_38     Document Type: Conference Paper

References (6)

1. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proc. of the 29th ICALP, 2002.
2. G. Cormode and S.Muthukrishnan. What's hot and what's not: Tracking most frequent items dynamically. In Proc. of PODS'03, 2003.
3. E. Demaine, A. López-Ortiz, and J. I. Munro. Frequency estimation of internet packet streams with limited space. In Proc. of 10th Annual European Symposium on Algorithms, 2002.
4. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In Proc. of VLDB'02, 2002.
5. S. S. Richard M. Karp, Christos H. Papadimitrlou. A simple algorithm for finding frequent elements in streams and bags. In ACM Transactions on Database Systems, volume 28, pages 51-55, 2003.
6. J. X. Yu, Z. Chong, H. Lu, and A. Zhou. False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In Proc. of VLDB'04, 2004.