{"id":"https://openalex.org/W2975312581","doi":"https://doi.org/10.1109/isit.2019.8849717","title":"Greedy additive approximation algorithms for minimum-entropy coupling problem","display_name":"Greedy additive approximation algorithms for minimum-entropy coupling problem","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975312581","doi":"https://doi.org/10.1109/isit.2019.8849717","mag":"2975312581"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849717","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5073915297","display_name":"Massimiliano Rossi","orcid":"https://orcid.org/0000-0002-3012-1394"},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"funder","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Massimiliano Rossi","raw_affiliation_strings":["Department of Computer Science, University of Verona, Verona, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Verona, Verona, Italy","institution_ids":["https://openalex.org/I119439378"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073915297"],"corresponding_institution_ids":["https://openalex.org/I119439378"],"apc_list":null,"apc_paid":null,"fwci":0.264,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.363756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":77,"max":79},"biblio":{"volume":"14","issue":null,"first_page":"1127","last_page":"1131"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9877,"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/T10320","display_name":"Neural Networks and Applications","score":0.9877,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9605,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10136","display_name":"Statistical Methods and Inference","score":0.9597,"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":[],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7208141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5872433},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5361421},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5138486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47715586},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.44950166},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41614354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29703027},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1526143},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07760084},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"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":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849717","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":11,"referenced_works":["https://openalex.org/W2006309149","https://openalex.org/W2112883966","https://openalex.org/W2113990831","https://openalex.org/W2143891888","https://openalex.org/W2155799962","https://openalex.org/W2160148685","https://openalex.org/W2585449849","https://openalex.org/W2963402441","https://openalex.org/W2963705438","https://openalex.org/W2964029778","https://openalex.org/W4300694379"],"related_works":["https://openalex.org/W4312077400","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W2898570308","https://openalex.org/W2574250816","https://openalex.org/W2389640906","https://openalex.org/W2163115662","https://openalex.org/W2019216770","https://openalex.org/W189401716","https://openalex.org/W1594413663"],"abstract_inverted_index":{"Given":[0],"two":[1,36],"probability":[2],"distributions":[3,59],"p":[4,65],"=":[5,21],"(p":[6],"1":[9,25],",p":[10],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2":[13,29],",\u2026,p":[14],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n":[17],")":[18,34],"and":[19,41,62,66,77,98],"q":[20,67],"(q":[22],",q":[26],",\u2026,q":[30],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m":[33],"of":[35,60,128,143,148],"discrete":[37],"random":[38],"variables":[39],"X":[40,61],"Y":[42,63],"respectively,":[43],"the":[44,51,111,126],"minimum-entropy":[45,52],"coupling":[46],"problem":[47,71],"is":[48,72],"to":[49,74],"find":[50],"joint":[53,58],"distribution":[54],"among":[55],"all":[56],"possible":[57],"having":[64],"as":[68],"marginals.":[69],"This":[70],"known":[73],"be":[75,147],"NP-hard":[76],"recently":[78],"have":[79],"been":[80],"proposed":[81,113],"greedy":[82],"algorithms":[83],"that":[84,90,110,145],"provide":[85,133],"different":[86],"guarantees,":[87],"i.e.":[88],"solutions":[89],"are":[91,156],"local":[92],"minimum":[93],"[Kocaoglu":[94],"et":[95,102,116],"al.":[96,103,117],"AAAI'17]":[97],"1-bit":[99,122],"approximation":[100,123,141],"[Cicalese":[101],"ISIT'17].":[104],"In":[105],"this":[106],"paper,":[107],"we":[108,132],"show":[109],"algorithm":[112],"by":[114],"Kocaoglu":[115],"provides,":[118],"in":[119,125,151],"addition,":[120],"a":[121,134],"guarantee":[124],"case":[127],"2":[129],"variables.":[130],"Then,":[131],"general":[135],"criteria":[136],"for":[137],"guaranteeing":[138],"an":[139],"additive":[140],"factor":[142],"1":[144],"might":[146],"independent":[149],"interest":[150],"other":[152],"contexts":[153],"where":[154],"couplings":[155],"used.":[157]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2975312581","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2025-02-22T07:32:05.787112","created_date":"2019-10-03"}