{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T21:18:20Z","timestamp":1776892700811,"version":"3.51.2"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,26]],"date-time":"2015-02-26T00:00:00Z","timestamp":1424908800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00778-015-0382-5","type":"journal-article","created":{"date-parts":[[2015,2,25]],"date-time":"2015-02-25T13:16:56Z","timestamp":1424870216000},"page":"395-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Conditional heavy hitters: detecting interesting correlations in data streams"],"prefix":"10.1007","volume":"24","author":[{"given":"Katsiaryna","family":"Mirylenka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Cormode","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Themis","family":"Palpanas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divesh","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,26]]},"reference":[{"key":"382_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"382_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: ACM Symposium on Theory of Computing, pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"key":"382_CR3","doi-asserted-by":"crossref","unstructured":"Arasu, A., Manku, G.S.: Approximate counts and quantiles over sliding windows. In: Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 286\u2013296. ACM (2004)","DOI":"10.1145\/1055558.1055598"},{"issue":"6","key":"382_CR4","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1214\/aoms\/1177699147","volume":"37","author":"LE Baum","year":"1966","unstructured":"Baum, L.E., Petrie, T.: Statistical inference for probabilistic functions of finite state Markov chains. Ann. Math. Stat. 37(6), 1554\u20131563 (1966)","journal-title":"Ann. Math. Stat."},{"key":"382_CR5","unstructured":"Boyer, B., Moore, J.: A fast majority vote algorithm. Tech. Rep. ICSCA-CMP-32. Institute for Computer Science, University of Texas (1981)"},{"issue":"4","key":"382_CR6","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2005","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2005)","journal-title":"Internet Math."},{"issue":"4","key":"382_CR7","first-page":"229","volume":"7","author":"C Budak","year":"2013","unstructured":"Budak, C., Georgiou, T., Agrawal, D., El Abbadi, A.: Geoscope: online detection of geo-correlated information trends in social networks. PVLDB 7(4), 229\u2013240 (2013)","journal-title":"PVLDB"},{"key":"382_CR8","doi-asserted-by":"crossref","unstructured":"Chang, J.H., Lee, W.S.: Finding recent frequent itemsets adaptively over online data streams. In: KDD, pp. 487\u2013492 (2003)","DOI":"10.1145\/956750.956807"},{"key":"382_CR9","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP) (2002)","DOI":"10.1007\/3-540-45465-9_59"},{"key":"382_CR10","doi-asserted-by":"crossref","unstructured":"Cormode, G., Hadjieleftheriou, M.: Finding frequent items in data streams. In: International Conference on Very Large Data Bases (2008)","DOI":"10.14778\/1454159.1454225"},{"key":"382_CR11","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Finding hierarchical heavy hitters in data streams. In: International Conference on Very Large Data Bases, pp. 464\u2013475 (2003)","DOI":"10.1016\/B978-012722442-8\/50048-3"},{"key":"382_CR12","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Tirthapura, S.: Time decaying aggregates in out-of-order streams. In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 89\u201398. ACM (2008)","DOI":"10.1145\/1376916.1376930"},{"issue":"1","key":"382_CR13","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithm. 55(1), 58\u201375 (2005)","journal-title":"J. Algorithm."},{"issue":"11","key":"382_CR14","first-page":"1662","volume":"5","author":"M Dallachiesa","year":"2012","unstructured":"Dallachiesa, M., Nushi, B., Mirylenka, K., Palpanas, T.: Uncertain time-series similarity: return to the basics. PVLDB 5(11), 1662\u20131673 (2012)","journal-title":"PVLDB"},{"key":"382_CR15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.datak.2013.05.007","volume":"87","author":"M Dallachiesa","year":"2013","unstructured":"Dallachiesa, M., Palpanas, T.: Identifying streaming frequent items in ad hoc time windows. Data Knowl. Eng. 87, 66\u201390 (2013)","journal-title":"Data Knowl. Eng."},{"key":"382_CR16","doi-asserted-by":"crossref","unstructured":"Demaine, E., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: European Symposium on Algorithms (ESA) (2002)","DOI":"10.1007\/3-540-45749-6_33"},{"key":"382_CR17","doi-asserted-by":"crossref","unstructured":"Duong, T., Goud, B., Schauer, K.: Closed-form density-based framework for automatic detection of cellular morphology changes. Proc. Natl. Acad. Sci. 109(22), 8382\u20138387 (2012)","DOI":"10.1073\/pnas.1117796109"},{"key":"382_CR18","unstructured":"Durme, B.V., Lall, A.: Streaming pointwise mutual information. In: Advances in Neural Information Processing Systems, pp. 1892\u20131900 (2009)"},{"key":"382_CR19","doi-asserted-by":"crossref","unstructured":"Gehrke, J., Korn, F., Srivastava, D.: On computing correlated aggregates over continual data streams. In: ACM SIGMOD International Conference on Management of Data, pp. 13\u201324 (2001)","DOI":"10.1145\/375663.375665"},{"key":"382_CR20","unstructured":"Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining frequent patterns in data streams at multiple time granularities. In: Kargupta, H., Joshi, A., Sivakumar, K., Yesha, Y. (eds.) Next Generation Data Mining, pp. 191\u2013212 (2003)"},{"key":"382_CR21","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD Conference, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"382_CR22","doi-asserted-by":"crossref","unstructured":"Lahiri, B., Tirthapura, S.: Finding correlated heavy-hitters over data streams. In: IEEE 28th International Conference on Performance Computing and Communications (IPCCC), pp. 307\u2013314. IEEE (2009)","DOI":"10.1109\/PCCC.2009.5403820"},{"key":"382_CR23","doi-asserted-by":"crossref","unstructured":"Lee, L-K., Ting, H.F.: A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In: Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 290\u2013297. ACM (2006)","DOI":"10.1145\/1142351.1142393"},{"key":"382_CR24","doi-asserted-by":"crossref","unstructured":"Letchner, J., R\u00e9, C., Balazinska, M., Philipose, M.: Approximation trade-offs in Markovian stream processing: an empirical study. In: IEEE 26th International Conference on Data Engineering (ICDE), pp. 936\u2013939. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447926"},{"issue":"4","key":"382_CR25","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","volume":"68","author":"N Manerikar","year":"2009","unstructured":"Manerikar, N., Palpanas, T.: Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl. Eng. 68(4), 415\u2013430 (2009)","journal-title":"Data Knowl. Eng."},{"key":"382_CR26","doi-asserted-by":"crossref","unstructured":"Manku, G., Motwani, R.: Approximate frequency counts over data streams. In: International Conference on Very Large Data Bases, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"382_CR27","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E.: Efficient computation of frequent and top-k elements in data streams. In: International Conference on Database Theory (2005)","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"382_CR28","doi-asserted-by":"crossref","unstructured":"Mirylenka, K., Cormode, G., Palpanas, T., Srivastava, D.: Finding interesting correlations with conditional heavy hitters. In: International Conference on Data Engineering (ICDE) (2013)","DOI":"10.1109\/ICDE.2013.6544898"},{"key":"382_CR29","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Sci. Comput. Program. 2, 143\u2013152 (1982)","journal-title":"Sci. Comput. Program."},{"key":"382_CR30","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., Los Altos (1988)"},{"key":"382_CR31","volume-title":"Web Caching and Replication","author":"M Rabinovich","year":"2002","unstructured":"Rabinovich, M., Spatschek, O.: Web Caching and Replication. Addison-Wesley Longman Publishing Co., Inc, Boston (2002)"},{"issue":"3","key":"382_CR32","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1111\/j.2517-6161.1985.tb01383.x","volume":"47","author":"AE Raftery","year":"1985","unstructured":"Raftery, A.E.: A model of high-order Markov chains. J. R. Stat. Soc. Series B Methodol. 47(3), 528\u2013539 (1985)","journal-title":"J. R. Stat. Soc. Series B Methodol."},{"issue":"2","key":"382_CR33","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.: The earth mover\u2019s distance as a metric for image retrieval. Int. J. Comput. Vision 40(2), 99\u2013121 (2000)","journal-title":"Int. J. Comput. Vision"},{"key":"382_CR34","doi-asserted-by":"crossref","unstructured":"Tantono, F.I., Manerikar, N., Palpanas, T.: Efficiently discovering recent frequent items in data streams. In: Scientific and Statistical Database Management, pp. 222\u2013239. Springer, Berlin, Heidelberg (2008)","DOI":"10.1007\/978-3-540-69497-7_16"},{"key":"382_CR35","doi-asserted-by":"crossref","unstructured":"Venkataraman, S., Song, D.X., Gibbons, P.B., Blum, A.: New streaming algorithms for fast detection of superspreaders. In: Network and Distributed System Security Symposium NDSS (2005)","DOI":"10.21236\/ADA461026"},{"key":"382_CR36","doi-asserted-by":"crossref","unstructured":"Wang, P., Wang, H., Wang, W.: Finding semantics in time series. In: ACM SIGMOD International Conference on Management of Data, pp. 385\u2013396 (2011)","DOI":"10.1145\/1989323.1989364"},{"issue":"1\/2","key":"382_CR37","doi-asserted-by":"crossref","first-page":"28","DOI":"10.2307\/2332510","volume":"34","author":"BL Welch","year":"1947","unstructured":"Welch, B.L.: The generalization of \u2018student\u2019s\u2019 problem when several different population variances are involved. Biometrika 34(1\/2), 28\u201335 (1947)","journal-title":"Biometrika"},{"key":"382_CR38","doi-asserted-by":"crossref","unstructured":"Yu, P.S., Chi, Y.: Association rule mining on streams. In: Encyclopedia of Database Systems, pp. 136\u2013139. Springer-Verlag (2009)","DOI":"10.1007\/978-0-387-39940-9_25"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0382-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-015-0382-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0382-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T00:44:00Z","timestamp":1747701840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-015-0382-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,26]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["382"],"URL":"https:\/\/doi.org\/10.1007\/s00778-015-0382-5","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,26]]}}}