Finding frequent items in data streams using hierarchical information

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2007, Pages 431-436

  Xiaoyu, Wang ^a   Hongyan, Liu ^a   Jiawei, Han ^b  

^a TSINGHUA UNIVERSITY   (China)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; HIERARCHICAL SYSTEMS; INFORMATION RETRIEVAL;

DATA STREAMS; HIERARCHICAL INFORMATION;

DATA MINING;

EID: 40949113226     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2007.4413754     Document Type: Conference Paper

References (14)

1. Ahmed Metwally, Divyakant Agrawal, Ame El Abbadi. Efficient Computation of Frequent and Top-k Elements in Data Streams. Proceedings of the 10th International Conference on Database Theory(ICDT), 2005, January: 398-412
2. Gurmeet Singh Manku, Rajeev Motwani. Approximate Frequency Counts over Data Streams. Proceedings of the 28th International Conference on Very Large Data Bases(VLDB), 2002, August: 346-357
3. Graham Cormode, Flip Kom, S.Muthukrishnan, Divesh Srivastava. Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data. Proceedings of the ACM SIGMOD Conference on Management of Data, 2004, June: 155-166
4. Jiawei Han, Yongjian Fu. Discovery of Multiple-Level Association Rules from Large Databases. Proceedings of the 21th International Conference on Very Large Data Bases(VLDB), 1995,September: 420-431
5. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D.Toth. Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams. Principles of Database Systems(PODS), 2005, June: 13-15
6. Ramakrishnan Srikant, Rakesh Agrawal. Mining Generalized Association Rules. Proceedings of the 21th International Conference on Very Large Data Bases(VLDB), 1995,September: 409-419
7. Rakesh Agrawal, Ramakrishnan Srikant. Fast Algorithms for Mining Association Rules. Proceedings of the 20th International Conference on Very Large Data Bases(VLDB), 1994,September: 487-499
8. Burton H. Bloom. Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM, 13(7):422-426, 1970.
9. M. Charikar, K. Chen, and M. Farach-Colton. Finding Frequent Items in Data Streams. In Proceedings of the 29th ICALP International Colloquium on Automata, Languages and Programming, pages 693-703, 2002.
10. G. Cormode and S. Muthukrishnan. Whats Hot and Whats Not: Tracking Most Frequent Items Dynamically. In Proceedings of the 22nd ACM PODS Symposium on Principles of Databse Systems, pages 296-306, June 2003.
11. E. D. Demaine, A. Lopez-Ortiz, and J. I. Munro. Frequency Estimation of Internet Packet Streams with Limited Space. In Proceedings of the 10th ESA Annual European Symposium on Algorithms, pages 348-360, 2002.
12. C. Estan and G. Varghese. New Directions in Traffic Measurement and Accounting: Focusing on the Elephants, Ignoring the Mice. ACM Transactions on Computer Systems, 21(3):270-313, 2003.
13. R. Karp, S. Shenker, and C. Papadimitriou. A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems, 28(1):51-55, 2003.
14. D. E. Knuth. The Art of Programming. Addison-Wesley, 1973.