{"id":"https://openalex.org/W2158395931","doi":"https://doi.org/10.1109/isit.2004.1365499","title":"Minimum description length vs. maximum likelihood in lossy data compression","display_name":"Minimum description length vs. maximum likelihood in lossy data compression","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2158395931","doi":"https://doi.org/10.1109/isit.2004.1365499","mag":"2158395931"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365499","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365499","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-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/A5089127356","display_name":"Mokshay Madiman","orcid":"https://orcid.org/0000-0002-2992-1829"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Madiman","raw_affiliation_strings":["Division of Applied Mathematics, Brown University, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Division of Applied Mathematics, Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067962267","display_name":"Matthew Tom Harrison","orcid":"https://orcid.org/0000-0001-7425-452X"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Harrison","raw_affiliation_strings":["Division of Applied Mathematics, Brown University, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Division of Applied Mathematics, Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044225058","display_name":"Ioannis Kontoyiannis","orcid":"https://orcid.org/0000-0001-7242-6375"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I. Kontoyiannis","raw_affiliation_strings":["Division of Applied Mathematics, Brown University, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Division of Applied Mathematics, Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089127356"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":2.3106,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90026206,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"462","last_page":"462"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.9324604272842407},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.8663398027420044},{"id":"https://openalex.org/keywords/minimum-description-length","display_name":"Minimum description length","score":0.6570683717727661},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.6527687907218933},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.5881383419036865},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.5720021724700928},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5179480910301208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47226110100746155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46987587213516235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36904412508010864},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.20958909392356873},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.0842093825340271}],"concepts":[{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.9324604272842407},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.8663398027420044},{"id":"https://openalex.org/C87465248","wikidata":"https://www.wikidata.org/wiki/Q1417790","display_name":"Minimum description length","level":2,"score":0.6570683717727661},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.6527687907218933},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.5881383419036865},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.5720021724700928},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5179480910301208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47226110100746155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46987587213516235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36904412508010864},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.20958909392356873},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0842093825340271},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2004.1365499","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365499","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:generic.eprints.org:960528","is_oa":false,"landing_page_url":"http://publications.eng.cam.ac.uk/960528/","pdf_url":null,"source":{"id":"https://openalex.org/S4406922847","display_name":"Cambridge University Engineering Department Publications Database","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1550672295","https://openalex.org/W2143648696","https://openalex.org/W2157677428","https://openalex.org/W2163714951","https://openalex.org/W2169249327"],"related_works":["https://openalex.org/W2385628723","https://openalex.org/W2547124190","https://openalex.org/W3180760233","https://openalex.org/W3035703949","https://openalex.org/W4247601675","https://openalex.org/W1970394887","https://openalex.org/W755971114","https://openalex.org/W2118338613","https://openalex.org/W1982468865","https://openalex.org/W4210455546"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"the":[3,17,20,35],"minimum":[4],"description":[5],"length":[6],"principle":[7],"in":[8,12],"maximum":[9],"likelihood":[10],"estimate(MLE)":[11],"lossy":[13],"data":[14],"compression.":[15],"In":[16],"lossless":[18],"case":[19],"problem":[21],"of":[22],"optimal":[23],"compression":[24],"is":[25],"theoretically":[26],"equivalent":[27],"to":[28],"finding":[29],"a":[30],"probability":[31],"distributions":[32],"and":[33],"minimizes":[34],"code-lengths.":[36]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}