{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T06:42:48Z","timestamp":1720334568677},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1016\/j.ipl.2024.106490","type":"journal-article","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T06:04:08Z","timestamp":1709186648000},"page":"106490","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Sparsifying Count Sketch"],"prefix":"10.1016","volume":"186","author":[{"given":"Bhisham Dev","family":"Verma","sequence":"first","affiliation":[]},{"given":"Rameshwar","family":"Pratap","sequence":"additional","affiliation":[]},{"given":"Punit Pankaj","family":"Dubey","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ipl.2024.106490_br0010","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","article-title":"Finding frequent items in data streams","volume":"312","author":"Charikar","year":"2004","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.ipl.2024.106490_br0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2493252.2493254","article-title":"Compressed matrix multiplication","volume":"5","author":"Pagh","year":"2013","journal-title":"ACM Trans. Comput. Theory"},{"key":"10.1016\/j.ipl.2024.106490_br0030","author":"Shi"},{"key":"10.1016\/j.ipl.2024.106490_br0040","series-title":"Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"239","article-title":"Fast and scalable polynomial kernels via explicit feature maps","author":"Pham","year":"2013"},{"key":"10.1016\/j.ipl.2024.106490_br0050","series-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019","first-page":"7394","article-title":"Incremental randomized sketching for online kernel learning","volume":"vol. 97","author":"Zhang","year":"2019"},{"key":"10.1016\/j.ipl.2024.106490_br0060","series-title":"Introduction to Algorithms","author":"Cormen","year":"2022"},{"key":"10.1016\/j.ipl.2024.106490_br0070","series-title":"Conference in Modern Analysis and Probability","first-page":"189","article-title":"Extensions of Lipschitz mappings into a Hilbert space","author":"Johnson","year":"1983"},{"key":"10.1016\/j.ipl.2024.106490_br0080","series-title":"Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '06","first-page":"287","article-title":"Very sparse random projections","author":"Li","year":"2006"},{"key":"10.1016\/j.ipl.2024.106490_br0090","series-title":"Learning Theory","first-page":"635","article-title":"Improving random projections using marginal information","author":"Li","year":"2006"},{"key":"10.1016\/j.ipl.2024.106490_br0100","first-page":"1","article-title":"Variance reduction in feature hashing using mle and control variate method","author":"Verma","year":"2022","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ipl.2024.106490_br0110","series-title":"Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09","first-page":"1113","article-title":"Feature hashing for large scale multitask learning","author":"Weinberger","year":"2009"},{"key":"10.1016\/j.ipl.2024.106490_br0120","series-title":"An Introduction to Probability Theory and Its Applications, vol. 1","author":"Feller","year":"1968"},{"key":"10.1016\/j.ipl.2024.106490_br0130","series-title":"A Modern Introduction to Probability and Statistics: Understanding Why and How, vol. 488","author":"Dekking","year":"2005"},{"key":"10.1016\/j.ipl.2024.106490_br0140","series-title":"35th Annual Symposium on Foundations of Computer Science","first-page":"592","article-title":"Tail bounds for occupancy and the satisfiability threshold conjecture","author":"Kamath","year":"1994"},{"key":"10.1016\/j.ipl.2024.106490_br0150","author":"Lichman"},{"key":"10.1016\/j.ipl.2024.106490_br0160","series-title":"VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"Agrawal","year":"1994"},{"key":"10.1016\/j.ipl.2024.106490_br0170","author":"Chakrabarti"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019024000206?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019024000206?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T00:52:43Z","timestamp":1715129563000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019024000206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":17,"alternative-id":["S0020019024000206"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2024.106490","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sparsifying Count Sketch","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2024.106490","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106490"}}