{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:08:57Z","timestamp":1759133337167,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,10,24]],"date-time":"2015-10-24T00:00:00Z","timestamp":1445644800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,10,24]],"date-time":"2015-10-24T00:00:00Z","timestamp":1445644800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0834743"],"award-info":[{"award-number":["CNS-0834743"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0831903"],"award-info":[{"award-number":["CNS-0831903"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10618-015-0438-6","type":"journal-article","created":{"date-parts":[[2015,10,24]],"date-time":"2015-10-24T09:33:50Z","timestamp":1445679230000},"page":"797-818","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Identifying correlated heavy-hitters in a two-dimensional data stream"],"prefix":"10.1007","volume":"30","author":[{"given":"Bibudh","family":"Lahiri","sequence":"first","affiliation":[]},{"given":"Arko Provo","family":"Mukherjee","sequence":"additional","affiliation":[]},{"given":"Srikanta","family":"Tirthapura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,24]]},"reference":[{"issue":"3","key":"438_CR1","doi-asserted-by":"publisher","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":"438_CR2","doi-asserted-by":"crossref","unstructured":"Babcock B, Datar M, Motwani R, O\u2019Callaghan L (2003) Maintaining variance and k-medians over data stream windows. In: Proceedings of the twenty-second ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS), pp 234\u2013243","DOI":"10.1145\/773153.773176"},{"key":"438_CR3","doi-asserted-by":"crossref","unstructured":"Busch C, Tirthapura S (2007) A deterministic algorithm for summarizing asynchronous streams over a sliding window. In: STACS","DOI":"10.1145\/1146381.1146397"},{"key":"438_CR4","unstructured":"CAIDA: OC48 traces dataset. \n                    https:\/\/data.caida.org\/datasets\/oc48\/oc48-original\/20020814\/5min\/"},{"issue":"1","key":"438_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M Charikar","year":"2004","unstructured":"Charikar M, Chen K, Farach-Colton M (2004) Finding frequent items in data streams. Theor Comput Sci 312(1):3\u201315","journal-title":"Theor Comput Sci"},{"key":"438_CR6","doi-asserted-by":"crossref","unstructured":"Cormode G, Muthukrishnan S (2003) What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. In: Proceedings of the 22nd ACM SIGMOD international conference on management of data\/principles of database systems (PODS), pp 296\u2013306","DOI":"10.1145\/773153.773182"},{"issue":"1","key":"438_CR7","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 (2005) An improved data stream summary: the count-min sketch and its applications. J Algorithms 55(1):58\u201375","journal-title":"J Algorithms"},{"issue":"10","key":"438_CR8","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","journal-title":"Commun ACM"},{"key":"438_CR9","doi-asserted-by":"crossref","unstructured":"Cormode G, Tirthapura S, Xu B (2009) Time-decayed correlated aggregates over data streams. In: Proceedings of the SIAM international conference on data mining (SDM), pp 269\u2013280","DOI":"10.1137\/1.9781611972795.24"},{"key":"438_CR10","doi-asserted-by":"crossref","unstructured":"Cullingford RE (2009) Correlation and collaboration in anomaly detection. In: Cybersecurity applications & technology conference for homeland security (CATCH), pp 251\u2013254","DOI":"10.1109\/CATCH.2009.34"},{"key":"438_CR11","doi-asserted-by":"crossref","unstructured":"Demaine ED, L\u00f3pez-Ortiz A, Munro JI (2002a) Frequency estimation of internet packet streams with limited space. In: Proceedings of the 10th annual european symposium (ESA), pp 348\u2013360","DOI":"10.1007\/3-540-45749-6_33"},{"key":"438_CR12","doi-asserted-by":"crossref","unstructured":"Demaine ED, L\u00f3pez-Ortiz A, Munro JI (2002b) Frequency estimation of internet packet streams with limited space. Tech rep","DOI":"10.1007\/3-540-45749-6_33"},{"key":"438_CR13","doi-asserted-by":"crossref","unstructured":"Estan C, Savage S, Varghese G (2003) Automatically inferring patterns of resource consumption in network traffic. In: Proceedings of the ACM SIGCOMM 2003 conference on applications, technologies, architectures, and protocols for computer communication (SIGCOMM), pp 137\u2013148","DOI":"10.1145\/863955.863972"},{"key":"438_CR14","doi-asserted-by":"crossref","unstructured":"Estan C, Varghese G (2002) New directions in traffic measurement and accounting. In: Proceedings of the ACM SIGCOMM 2002 conference on applications, technologies, architectures, and protocols for computer communication (SIGCOMM), pp 323\u2013336","DOI":"10.1145\/633025.633056"},{"key":"438_CR15","doi-asserted-by":"crossref","unstructured":"Gehrke J, Korn F, Srivastava D (2001) On computing correlated aggregates over continual data streams. In: Proceedings of the 20th ACM SIGMOD international conference on management of data (SIGMOD), pp 13\u201324","DOI":"10.1145\/376284.375665"},{"key":"438_CR16","unstructured":"Google: Google n-grams dataset. \n                    http:\/\/storage.googleapis.com\/books\/ngrams\/books\/datasetsv2.html"},{"key":"438_CR17","doi-asserted-by":"crossref","unstructured":"Greenwald M, Khanna S (2001) Space-efficient online computation of quantile summaries. In: Proceedings of the 20th ACM SIGMOD international conference on management of data (SIGMOD), pp 58\u201366","DOI":"10.1145\/376284.375670"},{"key":"438_CR18","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:51\u201355","journal-title":"ACM Trans Database Syst"},{"key":"438_CR19","unstructured":"Manku GS, Motwani R (2002) Approximate frequency counts over data streams. In: Proceedings of 28th international conference on very large data bases (VLDB), pp 346\u2013357"},{"issue":"2","key":"438_CR20","doi-asserted-by":"publisher","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 Program 2(2):143\u2013152","journal-title":"Sci Comput Program"},{"key":"438_CR21","doi-asserted-by":"crossref","unstructured":"Tirthapura S, Woodruff DP (2012) A general method for estimating correlated aggregates over a data stream. In: Proceedings of the ICDE, pp 162\u2013173","DOI":"10.1109\/ICDE.2012.62"},{"issue":"5","key":"438_CR22","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00446-007-0048-7","volume":"20","author":"B Xu","year":"2008","unstructured":"Xu B, Tirthapura S, Busch C (2008) Sketching asynchronous data streams over sliding windows. Distrib Comput 20(5):359\u2013374","journal-title":"Distrib Comput"},{"key":"438_CR23","doi-asserted-by":"crossref","unstructured":"Zhang L, Guan Y (2007) Variance estimation over sliding windows. In: Proceedings of the twenty-sixth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS), pp 225\u2013232","DOI":"10.1145\/1265530.1265562"},{"key":"438_CR24","doi-asserted-by":"crossref","unstructured":"Zhang Y, Singh S, Sen S, Duffield NG, Lund C (2004) Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications. In: Internet measurement conference (IMC), pp 101\u2013114","DOI":"10.1145\/1028788.1028802"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0438-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-015-0438-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0438-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0438-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:45:18Z","timestamp":1589723118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-015-0438-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,24]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["438"],"URL":"https:\/\/doi.org\/10.1007\/s10618-015-0438-6","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2015,10,24]]},"assertion":[{"value":"2 October 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}