{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:07:59Z","timestamp":1761581279089},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/allerton.2014.7028590","type":"proceedings-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T19:24:07Z","timestamp":1423164247000},"page":"1188-1195","source":"Crossref","is-referenced-by-count":6,"title":["Highly compact virtual maximum likelihood sketches for counting big network data"],"prefix":"10.1109","author":[{"given":"Zhen","family":"Mo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882836"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2080285"},{"key":"3","article-title":"Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm","author":"flajolet","year":"2007","journal-title":"Proc of AOFA International Conference on Analysis of Algorithms"},{"key":"2","first-page":"605","article-title":"Loglog counting of large cardinalities","author":"durand","year":"2003","journal-title":"ESA '99 European Symposium on Algorithms"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"10","article-title":"New streaming algorithms for fast detection of superspreaders","author":"venkatataman","year":"2005","journal-title":"Proc of NDSS"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934979"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461921"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375472"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.877139"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884032"},{"key":"8","article-title":"Counting distinct elements in a data stream","author":"bar-yossef","year":"2002","journal-title":"Proc of RANDOM Workshop on Randomization and Approximation"}],"event":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2014,9,30]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2014,10,3]]}},"container-title":["2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7008053\/7028426\/07028590.pdf?arnumber=7028590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T04:56:54Z","timestamp":1490331414000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7028590\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/allerton.2014.7028590","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}