{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:00:19Z","timestamp":1759683619482,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":21,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186082","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"1705-1714","source":"Crossref","is-referenced-by-count":4,"title":["Finding Subcube Heavy Hitters in Analytics Data Streams"],"prefix":"10.1145","author":[{"given":"Branislav","family":"Kveton","sequence":"first","affiliation":[{"name":"Adobe Research, San Jose, CA, USA"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, NJ, USA"}]},{"given":"Hoa T.","family":"Vu","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, Amherst, MA, USA"}]},{"given":"Yikun","family":"Xian","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, NJ, USA"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186082-1","unstructured":"Ion Androutsopoulos, Georgios Paliouras, Vangelis Karkaletsis, Georgios Sakkis, Constantine D. Spyropoulos, and Panagiotis Stamatopoulos. 2000. Learning to Filter Spam E-Mail: A Comparison of a Naive Bayesian and a Memory-Based Approach. CoRR cs.CL\/0009009 (2000)."},{"key":"key-10.1145\/3178876.3186082-2","unstructured":"Vladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, and Rafail Ostrovsky. 2010. AMS Without 4-Wise Independence on Product Domains. In STACS (LIPIcs), Vol. 5. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 119--130."},{"key":"key-10.1145\/3178876.3186082-3","doi-asserted-by":"crossref","unstructured":"Vladimir Braverman and Rafail Ostrovsky. 2010. Measuring independence of datasets. In STOC. ACM, 271--280.","DOI":"10.1145\/1806689.1806728"},{"key":"key-10.1145\/3178876.3186082-4","doi-asserted-by":"crossref","unstructured":"Graham Cormode. 2008. Finding Frequent Items in Data Streams. http: \/\/dmac.rutgers.edu\/Workshops\/WGUnifyingTheory\/Slides\/cormode.pdf. (2008). DIMACS Workshop.","DOI":"10.14778\/1454159.1454225"},{"key":"key-10.1145\/3178876.3186082-5","doi-asserted-by":"crossref","unstructured":"Graham Cormode and S. Muthukrishnan. 2004. An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. In LATIN (Lecture Notes in Computer Science), Vol. 2976. Springer, 29--38.","DOI":"10.1007\/978-3-540-24698-5_7"},{"key":"key-10.1145\/3178876.3186082-6","unstructured":"Constantinos Daskalakis, Nishanth Dikkala, and Gautam Kamath. 2016. Testing Ising Models. CoRR abs\/1612.03147 (2016). arXiv:1612.03147 http:\/\/arxiv.org\/ abs\/1612.03147"},{"key":"key-10.1145\/3178876.3186082-7","doi-asserted-by":"crossref","unstructured":"Marco F. Duarte, Volkan Cevher, and Richard G. Baraniuk. 2009. Model-based compressive sensing for signal ensembles. In Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on. IEEE, 244--250.","DOI":"10.1109\/ALLERTON.2009.5394807"},{"key":"key-10.1145\/3178876.3186082-8","doi-asserted-by":"crossref","unstructured":"Amit Goyal, Hal Daumé III, and Suresh Venkatasubramanian. 2009. Streaming for large scale NLP: Language Modeling. In Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, May 31 - June 5, 2009, Boulder, Colorado, USA. The Association for Computational Linguistics, 512--520. http:\/\/www.aclweb.org\/anthology\/ N09--1058","DOI":"10.3115\/1620754.1620829"},{"key":"key-10.1145\/3178876.3186082-9","doi-asserted-by":"crossref","unstructured":"Matthew Hamilton, Rhonda Chaytor, and Todd Wareham. 2006. The Parameterized Complexity of Enumerating Frequent Itemsets. In IWPEC (Lecture Notes in Computer Science), Vol. 4169. Springer, 227--238.","DOI":"10.1007\/11847250_21"},{"key":"key-10.1145\/3178876.3186082-10","unstructured":"Piotr Indyk and Andrew McGregor. 2008. Declaring independence via the sketching of sketches. In SODA. SIAM, 737--745."},{"key":"key-10.1145\/3178876.3186082-11","unstructured":"Branislav Kveton, Hung Hai Bui, Mohammad Ghavamzadeh, Georgios Theocharous, S. Muthukrishnan, and Siqi Sun. 2016. Graphical Model Sketch. In ECML\/PKDD (1) (Lecture Notes in Computer Science), Vol. 9851. Springer, 81--97."},{"key":"key-10.1145\/3178876.3186082-12","unstructured":"David D. Lewis, Yiming Yang, Tony G. Rose, and Fan Li. 2004. RCV1: A New Benchmark Collection for Text Categorization Research. Journal of Machine Learning Research 5 (2004), 361--397."},{"key":"key-10.1145\/3178876.3186082-13","doi-asserted-by":"crossref","unstructured":"Edo Liberty, Michael Mitzenmacher, Justin Thaler, and Jonathan Ullman. 2016. Space Lower Bounds for Itemset Frequency Sketches. In PODS. ACM, 441--454.","DOI":"10.1145\/2902251.2902278"},{"key":"key-10.1145\/3178876.3186082-14","doi-asserted-by":"crossref","unstructured":"Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schütze. 2008. Introduction to Information Retrieval. Cambridge University Press.","DOI":"10.1017\/CBO9780511809071"},{"key":"key-10.1145\/3178876.3186082-15","doi-asserted-by":"crossref","unstructured":"Andrew McGregor and Hoa T. Vu. 2015. Evaluating Bayesian Networks via Data Streams. In COCOON (Lecture Notes in Computer Science), Vol. 9198. Springer, 731--743.","DOI":"10.1007\/978-3-319-21398-9_57"},{"key":"key-10.1145\/3178876.3186082-16","doi-asserted-by":"crossref","unstructured":"Jayadev Misra and David Gries. 1982. Finding Repeated Elements. Sci. Comput. Program. 2, 2 (1982), 143--152.","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"key-10.1145\/3178876.3186082-17","unstructured":"Stuart J. Russell and Peter Norvig. 2010. Artificial Intelligence - A Modern Approach. Pearson Education."},{"key":"key-10.1145\/3178876.3186082-18","doi-asserted-by":"crossref","unstructured":"Jeffrey Scott Vitter. 1985. Random Sampling with a Reservoir. ACM Trans. Math. Softw. 11, 1 (1985), 37--57.","DOI":"10.1145\/3147.3165"},{"key":"key-10.1145\/3178876.3186082-19","unstructured":"David P. Woodruff. 2016. New Algorithms for Heavy Hitters in Data Streams (Invited Talk). In ICDT (LIPIcs), Vol. 48. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 4:1--4:12."},{"key":"key-10.1145\/3178876.3186082-20","unstructured":"Yandex 2013. Yandex Personalized Web Search Challenge. https:\/\/www.kaggle.com\/c\/yandex-personalized-web-search-challenge. (2013)."},{"key":"key-10.1145\/3178876.3186082-21","doi-asserted-by":"crossref","unstructured":"Guizhen Yang. 2004. The complexity of mining maximal frequent itemsets and maximal frequent patterns. In KDD. ACM, 344--353.","DOI":"10.1145\/1014052.1014091"}],"event":{"number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '18","name":"the 2018 World Wide Web Conference","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186082","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186082&ftid=1957421&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:28Z","timestamp":1750212688000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186082"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186082","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}