{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:12:57Z","timestamp":1761581577596,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,7,5]],"date-time":"2017-07-05T00:00:00Z","timestamp":1499212800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10618-017-0526-x","type":"journal-article","created":{"date-parts":[[2017,7,5]],"date-time":"2017-07-05T07:50:11Z","timestamp":1499241011000},"page":"162-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Fast and accurate mining of correlated heavy hitters"],"prefix":"10.1007","volume":"32","author":[{"given":"Italo","family":"Epicoco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1118-7109","authenticated-orcid":false,"given":"Massimo","family":"Cafaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Pulimeno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"issue":"2","key":"526_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Rec 22(2):207\u2013216","journal-title":"ACM SIGMOD Rec"},{"issue":"3","key":"526_CR2","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TKDE.2003.1198391","volume":"15","author":"R Ananthakrishna","year":"2003","unstructured":"Ananthakrishna R, Das A, Gehrke J, Korn F, Muthukrishnan S, Srivastava D (2003) Efficient approximation of correlated sums on data streams. IEEE Trans Knowl Data Eng 15(3):569\u2013572","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"526_CR3","unstructured":"Cafaro M, Pulimeno M (2016) Merging frequent summaries. In: Proceedings of the 17th Italian conference on theoretical computer science (ICTCS 2016), vol 1720, CEUR proceedings, pp 280\u2013285"},{"issue":"15","key":"526_CR4","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1002\/cpe.1761","volume":"23","author":"M Cafaro","year":"2011","unstructured":"Cafaro M, Tempesta P (2011) Finding frequent items in parallel. Concurr Comput Pract Exp 23(15):1774\u20131788. doi:\n                        10.1002\/cpe.1761","journal-title":"Concurr Comput Pract Exp"},{"key":"526_CR5","doi-asserted-by":"publisher","unstructured":"Cafaro M, Pulimeno M, Epicoco I, Aloisio G (2016a) Mining frequent items in the time fading model. Inf Sci 370\u2013371:221\u2013238. doi:\n                        10.1016\/j.ins.2016.07.077","DOI":"10.1016\/j.ins.2016.07.077"},{"key":"526_CR6","doi-asserted-by":"publisher","unstructured":"Cafaro M, Pulimeno M, Tempesta P (2016b) A parallel space saving algorithm for frequent items and the hurwitz zeta distribution. Inf Sci 329:1\u201319. doi:\n                        10.1016\/j.ins.2015.09.003\n                        \n                    , \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S002002551500657X","DOI":"10.1016\/j.ins.2015.09.003"},{"key":"526_CR7","doi-asserted-by":"publisher","unstructured":"Cafaro M, Pulimeno M, Epicoco I, Aloisio G (2017) Parallel space saving on multi- and many-core processors. Concurr Comput Pract Exp. doi:\n                        10.1002\/cpe.4160","DOI":"10.1002\/cpe.4160"},{"key":"526_CR8","doi-asserted-by":"crossref","unstructured":"Charikar M, Chen K, Farach-Colton M (2002) Finding frequent items in data streams. In: ICALP \u201902: proceedings of the 29th international colloquium on automata. Languages and programming. Springer-Verlag, pp 693\u2013703","DOI":"10.1007\/3-540-45465-9_59"},{"key":"526_CR9","doi-asserted-by":"publisher","unstructured":"Chen L, Mei Q (2014) Mining frequent items in data stream using time fading model. Inf Sci 257:54\u201369. doi:\n                        10.1016\/j.ins.2013.09.007\n                        \n                    , \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025513006403","DOI":"10.1016\/j.ins.2013.09.007"},{"issue":"1","key":"526_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-007-0092-4","volume":"16","author":"J Cheng","year":"2008","unstructured":"Cheng J, Ke Y, Ng W (2008) A survey on algorithms for mining frequent itemsets over data streams. Knowl Inf Syst 16(1):1\u201327. doi:\n                        10.1007\/s10115-007-0092-4","journal-title":"Knowl Inf Syst"},{"issue":"10","key":"526_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1562764.1562789","volume":"52","author":"G Cormode","year":"2009","unstructured":"Cormode G, Hadjieleftheriou M (2009) Finding the frequent items in streams of data. Commun ACM 52(10):97\u2013105. doi:\n                        10.1145\/1562764.1562789","journal-title":"Commun ACM"},{"issue":"1","key":"526_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode G, Muthukrishnan S (2005a) An improved data stream summary: the count-min sketch and its applications. J Algorithms 55(1):58\u201375. doi:\n                        10.1016\/j.jalgor.2003.12.001","journal-title":"J Algorithms"},{"issue":"1","key":"526_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G Cormode","year":"2005","unstructured":"Cormode G, Muthukrishnan S (2005b) What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. ACM Trans Database Syst 30(1):249\u2013278. doi:\n                        10.1145\/1061318.1061325","journal-title":"ACM Trans Database Syst"},{"key":"526_CR14","doi-asserted-by":"publisher","unstructured":"Cormode G, Korn F, Tirthapura S (2008) Exponentially decayed aggregates on data streams. In: IEEE 24th international conference on data engineering, 2008, ICDE 2008, pp 1379\u20131381, doi:\n                        10.1109\/ICDE.2008.4497562","DOI":"10.1109\/ICDE.2008.4497562"},{"issue":"5\u20136","key":"526_CR15","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1002\/sam.10053","volume":"2","author":"G Cormode","year":"2009","unstructured":"Cormode G, Tirthapura S, Xu B (2009) Time-decayed correlated aggregates over data streams. Stat Anal Data Min 2(5\u20136):294\u2013310","journal-title":"Stat Anal Data Min"},{"issue":"1","key":"526_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.14778\/1687627.1687653","volume":"2","author":"S Das","year":"2009","unstructured":"Das S, Antony S, Agrawal D, El Abbadi A (2009) Thread cooperation in multicore architectures for frequency counting over multiple data streams. Proc VLDB Endow 2(1):217\u2013228. doi:\n                        10.14778\/1687627.1687653","journal-title":"Proc VLDB Endow"},{"key":"526_CR17","doi-asserted-by":"crossref","unstructured":"Datar M, Gionis A, Indyk P, Motwani R (2002) Maintaining stream statistics over sliding windows: (extended abstract). In: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA \u201902. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp 635\u2013644","DOI":"10.1137\/S0097539701398363"},{"key":"526_CR18","doi-asserted-by":"crossref","unstructured":"Demaine ED, L\u00f3pez-Ortiz A, Munro JI (2002) Frequency estimation of internet packet streams with limited space. In: ESA, pp 348\u2013360","DOI":"10.1007\/3-540-45749-6_33"},{"key":"526_CR19","doi-asserted-by":"publisher","unstructured":"Erra U, Frola B (2012) Frequent items mining acceleration exploiting fast parallel sorting on the gpu. Proc Comput Sci 9(0):86\u201395, doi:\n                        10.1016\/j.procs.2012.04.010\n                        \n                    , \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050912001317\n                        \n                    , proceedings of the international conference on computational science, ICCS 2012","DOI":"10.1016\/j.procs.2012.04.010"},{"issue":"2","key":"526_CR20","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/376284.375665","volume":"30","author":"J Gehrke","year":"2001","unstructured":"Gehrke J, Korn F, Srivastava D (2001) On computing correlated aggregates over continual data streams. SIGMOD Rec 30(2):13\u201324. doi:\n                        10.1145\/376284.375665","journal-title":"SIGMOD Rec"},{"key":"526_CR21","doi-asserted-by":"publisher","unstructured":"Govindaraju NK, Raghuvanshi N, Manocha D (2005) Fast and approximate stream mining of quantiles and frequencies using graphics processors. In: Proceedings of the 2005 ACM SIGMOD international conference on management of data, SIGMOD \u201905, ACM, pp 611\u2013622, doi:\n                        10.1145\/1066157.1066227","DOI":"10.1145\/1066157.1066227"},{"issue":"2","key":"526_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Rec 29(2):1\u201312","journal-title":"ACM SIGMOD Rec"},{"key":"526_CR23","doi-asserted-by":"crossref","unstructured":"Jin C, Qian W, Sha C, Yu JX, Zhou A (2003) Dynamically maintaining frequent items over a data stream. In: Proceedings of CIKM, ACM Press, pp 287\u2013294","DOI":"10.1145\/956863.956918"},{"issue":"1","key":"526_CR24","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp RM, Shenker S, Papadimitriou CH (2003) A simple algorithm for finding frequent elements in streams and bags. ACM Trans Database Syst 28(1):51\u201355. doi:\n                        10.1145\/762471.762473","journal-title":"ACM Trans Database Syst"},{"issue":"4","key":"526_CR25","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s10618-015-0438-6","volume":"30","author":"B Lahiri","year":"2016","unstructured":"Lahiri B, Mukherjee AP, Tirthapura S (2016) Identifying correlated heavy-hitters in a two-dimensional data stream. Data Min Knowl Discov 30(4):797\u2013818. doi:\n                        10.1007\/s10618-015-0438-6","journal-title":"Data Min Knowl Discov"},{"issue":"4","key":"526_CR26","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","volume":"68","author":"N Manerikar","year":"2009","unstructured":"Manerikar N, Palpanas T (2009) Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl Eng 68(4):415\u2013430. doi:\n                        10.1016\/j.datak.2008.11.001","journal-title":"Data Knowl Eng"},{"key":"526_CR27","doi-asserted-by":"publisher","unstructured":"Manjhi A, Shkapenyuk V, Dhamdhere K, Olston C (2005) Finding (recently) frequent items in distributed data streams. In: Proceedings of 21st international conference on data engineering, 2005, ICDE 2005, pp 767\u2013778, doi:\n                        10.1109\/ICDE.2005.68","DOI":"10.1109\/ICDE.2005.68"},{"key":"526_CR28","doi-asserted-by":"crossref","unstructured":"Manku GS, Motwani R (2002) Approximate frequency counts over data streams. In: VLDB, pp 346\u2013357","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"3","key":"526_CR29","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1145\/1166074.1166084","volume":"31","author":"A Metwally","year":"2006","unstructured":"Metwally A, Agrawal D, Abbadi AE (2006) An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Trans Database Syst 31(3):1095\u20131133. doi:\n                        10.1145\/1166074.1166084","journal-title":"ACM Trans Database Syst"},{"issue":"3","key":"526_CR30","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00778-015-0382-5","volume":"24","author":"K Mirylenka","year":"2015","unstructured":"Mirylenka K, Cormode G, Palpanas T, Srivastava D (2015) Conditional heavy hitters: detecting interesting correlations in data streams. VLDB J 24(3):395\u2013414. doi:\n                        10.1007\/s00778-015-0382-5","journal-title":"VLDB J"},{"issue":"2","key":"526_CR31","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 (1982) Finding repeated elements. Sci Comput Progr 2(2):143\u2013152","journal-title":"Sci Comput Progr"},{"key":"526_CR32","doi-asserted-by":"publisher","unstructured":"Roy P, Teubner J, Alonso G (2012) Efficient frequent item counting in multi-core hardware. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201912, ACM, pp 1451\u20131459, doi:\n                        10.1145\/2339530.2339757","DOI":"10.1145\/2339530.2339757"},{"key":"526_CR33","doi-asserted-by":"publisher","unstructured":"Tangwongsan K, Tirthapura S, Wu KL (2014) Parallel streaming frequency-based aggregates. In: Proceedings of the 26th ACM symposium on parallelism in algorithms and architectures, SPAA \u201914, ACM, pp 236\u2013245, doi:\n                        10.1145\/2612669.2612695","DOI":"10.1145\/2612669.2612695"},{"issue":"3","key":"526_CR34","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"526_CR35","doi-asserted-by":"publisher","unstructured":"Zhang Y (2012) Parallelizing the weighted lossy counting algorithm in high-speed network monitoring. In: Second international conference on instrumentation, measurement, computer, communication and control (IMCCC), pp 757\u2013761, doi:\n                        10.1109\/IMCCC.2012.183","DOI":"10.1109\/IMCCC.2012.183"},{"key":"526_CR36","doi-asserted-by":"crossref","unstructured":"Zhang Y, Singh S, Sen S, Duffield N, Lund C (2004) Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications. In: Proceedings of the 4th ACM SIGCOMM conference on Internet measurement, ACM, pp 101\u2013114","DOI":"10.1145\/1028788.1028802"},{"issue":"18","key":"526_CR37","doi-asserted-by":"publisher","first-page":"2856","DOI":"10.1002\/cpe.3182","volume":"26","author":"Y Zhang","year":"2014","unstructured":"Zhang Y, Sun Y, Zhang J, Xu J, Wu Y (2014) An efficient framework for parallel and continuous frequent item monitoring. Concurr Comput Pract Exp 26(18):2856\u20132879. doi:\n                        10.1002\/cpe.3182","journal-title":"Concurr Comput Pract Exp"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-017-0526-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0526-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0526-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,10]],"date-time":"2018-01-10T00:33:15Z","timestamp":1515544395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-017-0526-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,5]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["526"],"URL":"https:\/\/doi.org\/10.1007\/s10618-017-0526-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2017,7,5]]}}}