{"id":"https://openalex.org/W2104635635","doi":"https://doi.org/10.1145/1798596.1798604","title":"A near-optimal algorithm for estimating the entropy of a stream","display_name":"A near-optimal algorithm for estimating the entropy of a stream","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2104635635","doi":"https://doi.org/10.1145/1798596.1798604","mag":"2104635635"},"language":"en","primary_location":{"id":"doi:10.1145/1798596.1798604","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1798596.1798604","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084208266","display_name":"Amit Chakrabarti","orcid":"https://orcid.org/0000-0003-3633-9180"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amit Chakrabarti","raw_affiliation_strings":["Dartmouth College, Hanover, NH"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, NH","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031896681","display_name":"Graham Cormode","orcid":"https://orcid.org/0000-0002-0698-0922"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Graham Cormode","raw_affiliation_strings":["AT&T Research, Park Avenue, NJ","AT&T Research, Park Avenue, NJ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Research, Park Avenue, NJ","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Research, Park Avenue, NJ#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101979548","display_name":"Andrew McGregor","orcid":"https://orcid.org/0000-0002-2124-160X"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Mcgregor","raw_affiliation_strings":["University of Massachusetts, Amherst, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1328,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.9405109,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"3","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.8230293989181519},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7514640092849731},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7091326117515564},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6403303742408752},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6402684450149536},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5654653310775757},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5404655933380127},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49091464281082153},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48284417390823364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4157068133354187},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39661717414855957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36324843764305115},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.095327228307724}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.8230293989181519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7514640092849731},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7091326117515564},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6403303742408752},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6402684450149536},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5654653310775757},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5404655933380127},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49091464281082153},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48284417390823364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4157068133354187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39661717414855957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36324843764305115},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.095327228307724},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1798596.1798604","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1798596.1798604","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:scholarworks.umass.edu:cs_faculty_pubs-1908","is_oa":false,"landing_page_url":"https://scholarworks.umass.edu/cs_faculty_pubs/909","pdf_url":null,"source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department Faculty Publication Series","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.182.7157","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.7157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.dartmouth.edu/%7Eac/Pubs/talg-entropy-opt.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.190.5419","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.5419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/people/Cormode_Graham/library/publications/ChakrabartiCormodeMcGregor10.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.324.3195","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.3195","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.umass.edu/~mcgregor/papers/07-entropy.pdf","raw_type":"text"},{"id":"pmh:oai:scholarworks.umass.edu:20.500.14394/10495","is_oa":false,"landing_page_url":"https://hdl.handle.net/20.500.14394/10495","pdf_url":null,"source":{"id":"https://openalex.org/S4306402057","display_name":"Scholarworks (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1141148357","display_name":null,"funder_award_id":"EIA-98-02068","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W31696346","https://openalex.org/W1603123426","https://openalex.org/W1628908379","https://openalex.org/W1785933978","https://openalex.org/W1990465412","https://openalex.org/W1993091968","https://openalex.org/W2002576896","https://openalex.org/W2004110412","https://openalex.org/W2004154913","https://openalex.org/W2006355640","https://openalex.org/W2069414131","https://openalex.org/W2075567379","https://openalex.org/W2076381458","https://openalex.org/W2078764670","https://openalex.org/W2080234606","https://openalex.org/W2080745194","https://openalex.org/W2082553115","https://openalex.org/W2085533912","https://openalex.org/W2099111195","https://openalex.org/W2109885200","https://openalex.org/W2113061123","https://openalex.org/W2119885577","https://openalex.org/W2129978406","https://openalex.org/W2130598205","https://openalex.org/W2132822431","https://openalex.org/W2150191781","https://openalex.org/W2152489475","https://openalex.org/W2152637787","https://openalex.org/W2160681854","https://openalex.org/W2165753192","https://openalex.org/W2621193479","https://openalex.org/W2917878349","https://openalex.org/W4241915340"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2052169362","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2963158951","https://openalex.org/W2070751425"],"abstract_inverted_index":{"We":[0,87,114],"describe":[1],"a":[2,11,18,24,67,71,89,142,155,162],"simple":[3],"algorithm":[4,63,104],"for":[5,130],"approximating":[6],"the":[7,60,121,159],"empirical":[8],"entropy":[9,124,160],"of":[10,13,21,38,70,93,109,120,161],"stream":[12],"m":[14,35,53],"values":[15],"up":[16],"to":[17,118,127,153,158],"multiplicative":[19,156],"factor":[20],"(1+\u03f5)":[22],"using":[23,145],"single":[25,143],"pass,":[26],"O":[27,41],"(\u03f5":[28,98],"\u22122":[29,95],"log":[30,34,46,47,51,52],"(\u03b4":[31],"\u22121":[32,44,49,99],")":[33,36,54],"words":[37],"space,":[39],"and":[40],"(log":[42],"\u03f5":[43],"+":[45,50],"\u03b4":[48],"processing":[55],"time":[56],"per":[57],"item":[58],"in":[59,107,141],"stream.":[61],"Our":[62],"is":[64,105,139],"based":[65],"upon":[66],"novel":[68],"extension":[69],"method":[72],"introduced":[73],"by":[74],"Alon":[75],"et":[76],"al.":[77],"[1999].":[78],"This":[79],"improves":[80],"over":[81],"previous":[82],"work":[83],"on":[84,112,165],"this":[85],"problem.":[86],"show":[88,115,136,151],"space":[90,129],"lower":[91],"bound":[92],"\u03a9(\u03f5":[94],"/log":[96],"2":[97],")),":[100],"demonstrating":[101],"that":[102,116,137],"our":[103],"near-optimal":[106],"terms":[108],"its":[110],"dependency":[111],"\u03f5.":[113],"generalizing":[117],"multiplicative-approximation":[119],"k":[122,131],"th-order":[123],"requires":[125],"close":[126],"linear":[128],"\u22651.":[132],"In":[133],"contrast":[134],"we":[135,150],"additive-approximation":[138],"possible":[140],"pass":[144],"only":[146],"poly-logarithmic":[147],"space.":[148],"Lastly,":[149],"how":[152],"compute":[154],"approximation":[157],"random":[163],"walk":[164],"an":[166],"undirected":[167],"graph.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}