{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:33:51Z","timestamp":1776785631125,"version":"3.51.2"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772492"],"award-info":[{"award-number":["61772492"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072428"],"award-info":[{"award-number":["62072428"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62271465"],"award-info":[{"award-number":["62271465"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Fund Project of Guangdong Academy of Medical Sciences, China","award":["YKY-KF202206"],"award-info":[{"award-number":["YKY-KF202206"]}]},{"name":"Suzhou Basic Research Program","award":["SYG202338"],"award-info":[{"award-number":["SYG202338"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1109\/tpami.2024.3388589","type":"journal-article","created":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T17:30:48Z","timestamp":1713202248000},"page":"7136-7153","source":"Crossref","is-referenced-by-count":8,"title":["Learning to Sketch: A Neural Approach to Item Frequency Estimation in Streaming Data"],"prefix":"10.1109","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6753-3050","authenticated-orcid":false,"given":"Yukun","family":"Cao","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China (USTC), Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7344-0487","authenticated-orcid":false,"given":"Yuan","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China (USTC), Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9919-2863","authenticated-orcid":false,"given":"Hairu","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China (USTC), Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5290-5408","authenticated-orcid":false,"given":"Xike","family":"Xie","sequence":"additional","affiliation":[{"name":"Data Darkness Lab (DDL), Center for Medical Imaging, Robotics, Analytic Computing & Learning (MIRACLE), Suzhou Institute for Advance Research, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6881-4444","authenticated-orcid":false,"given":"S. Kevin","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Biomedical Engineering, Division of Life Sciences and Medicine, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186569"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50039-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2743977"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/858"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230559"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994774"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465312"},{"key":"ref8","first-page":"1093","article-title":"Sketch algorithms for estimating point queries in NLP","volume-title":"Proc. Joint Conf. Empirical Methods Natural Lang. Process. Comput. Natural Lang. Learn.","author":"Goyal"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742008"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183726"},{"key":"ref15","article-title":"Learning-based frequency estimation algorithms","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Hsu"},{"key":"ref16","article-title":"New estimation algorithms for streaming data: Count-min can do more","author":"Deng","year":"2007","journal-title":"Webdocs. Cs Ualberta. Ca"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3229543.3229545"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452775"},{"key":"ref20","first-page":"991","article-title":"Fast and guaranteed tensor decomposition via sketching","volume-title":"Proc. 28th Int. Conf. Neural Inform. Process. Syst.-Volume 1","author":"Wang"},{"key":"ref21","first-page":"3984","article-title":"Polynomial tensor sketch for element-wise function of low-rank matrix","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Han"},{"key":"ref22","first-page":"2930","article-title":"Sketch-GNN: Scalable graph neural networks with sublinear training complexity","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ding"},{"key":"ref23","first-page":"10117","article-title":"Low-rank tucker decomposition of large tensors using TensorSketch","volume-title":"Proc. 32nd Int. Conf. Neural Inform. Process. Syst.","author":"Malik"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196930"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/infocom.2019.8737499"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"ref27","first-page":"5271","article-title":"Meta-learning neural bloom filters","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rae"},{"key":"ref28","article-title":"A model for learned bloom filters and related structures","author":"Mitzenmacher","year":"2018"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25846"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1561\/1900000004"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543615"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2021.3079209"},{"key":"ref33","first-page":"1842","article-title":"Meta-learning with memory-augmented neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Santoro"},{"key":"ref34","article-title":"Neural turing machines","author":"Graves","year":"2014"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1038\/nature20101"},{"key":"ref36","first-page":"1614","article-title":"From softmax to sparsemax: A sparse model of attention and multi-label classification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Martins"},{"key":"ref37","article-title":"On controllable sparse alternatives to softmax","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Laha"},{"key":"ref38","first-page":"3630","article-title":"Matching networks for one shot learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Vinyals"},{"key":"ref39","first-page":"7482","article-title":"Multi-task learning using uncertainty to weigh losses for scene geometry and semantics","volume-title":"Proc. IEEE Conf. Comput. Vis. Pattern Recognit.","author":"Kendall"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0210-7"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.05.022"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.protcy.2013.12.483"},{"key":"ref43","article-title":"Zipf, power-laws, and pareto-A ranking tutorial","author":"Adamic","year":"2000"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-010-0645-5"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3323334"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3240508.3243654"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2908904"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3394171.3413713"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-015-0494-1"},{"key":"ref50","first-page":"758","article-title":"Greed is good: Near-optimal submodular maximization via greedy optimization","volume-title":"Proc. 30th Conf. Learn. Theory","author":"Feldman"},{"key":"ref51","first-page":"773","article-title":"Greedy algorithms for cone constrained optimization with convergence guarantees","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 30: Annu. Conf. Neural Inf. Process. Syst.","author":"Locatello"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2601412"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367570"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3174570"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915223"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078335"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583154"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.67"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183726"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/10704791\/10499867.pdf?arnumber=10499867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T18:53:05Z","timestamp":1732819985000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10499867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":59,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2024.3388589","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}