{"id":"https://openalex.org/W2916723995","doi":"https://doi.org/10.1109/glocom.2018.8647224","title":"A Graph-Based Message Passing Approach for Noisy Source Coding via Information Bottleneck Principle","display_name":"A Graph-Based Message Passing Approach for Noisy Source Coding via Information Bottleneck Principle","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2916723995","doi":"https://doi.org/10.1109/glocom.2018.8647224","mag":"2916723995"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2018.8647224","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647224","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","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/A5083719597","display_name":"Shayan Hassanpour","orcid":"https://orcid.org/0000-0003-2598-0415"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Shayan Hassanpour","raw_affiliation_strings":["Department of Communications Engineering, University of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Communications Engineering, University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038472130","display_name":"Dirk W\u00fcbben","orcid":"https://orcid.org/0000-0003-3854-6140"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dirk Wubben","raw_affiliation_strings":["Department of Communications Engineering, University of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Communications Engineering, University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063992917","display_name":"Armin Dekorsy","orcid":"https://orcid.org/0000-0002-5790-1470"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Armin Dekorsy","raw_affiliation_strings":["Department of Communications Engineering, University of Bremen, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Communications Engineering, University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083719597"],"corresponding_institution_ids":["https://openalex.org/I180437899"],"apc_list":null,"apc_paid":null,"fwci":0.5536,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72284597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/information-bottleneck-method","display_name":"Information bottleneck method","score":0.7794162631034851},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7703841924667358},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7314028739929199},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.6019361019134521},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.592190146446228},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5836636424064636},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.518170952796936},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.49082717299461365},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4896991550922394},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.48544007539749146},{"id":"https://openalex.org/keywords/affinity-propagation","display_name":"Affinity propagation","score":0.45778170228004456},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.42199212312698364},{"id":"https://openalex.org/keywords/distributed-source-coding","display_name":"Distributed source coding","score":0.41189080476760864},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.304691880941391},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22937199473381042},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.19273096323013306},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.18913039565086365},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15073004364967346},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.12412360310554504}],"concepts":[{"id":"https://openalex.org/C60008888","wikidata":"https://www.wikidata.org/wiki/Q6031013","display_name":"Information bottleneck method","level":3,"score":0.7794162631034851},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7703841924667358},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7314028739929199},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.6019361019134521},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.592190146446228},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5836636424064636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.518170952796936},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.49082717299461365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4896991550922394},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.48544007539749146},{"id":"https://openalex.org/C109659709","wikidata":"https://www.wikidata.org/wiki/Q3407504","display_name":"Affinity propagation","level":5,"score":0.45778170228004456},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.42199212312698364},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.41189080476760864},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.304691880941391},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22937199473381042},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.19273096323013306},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.18913039565086365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15073004364967346},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.12412360310554504},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2018.8647224","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647224","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1518078339","https://openalex.org/W1686946872","https://openalex.org/W2011430131","https://openalex.org/W2033497516","https://openalex.org/W2096765209","https://openalex.org/W2099111195","https://openalex.org/W2137813581","https://openalex.org/W2164368671","https://openalex.org/W2165232124","https://openalex.org/W2275058256","https://openalex.org/W2335060803","https://openalex.org/W2478708596","https://openalex.org/W2510335549","https://openalex.org/W2583360924","https://openalex.org/W2625777111","https://openalex.org/W2753127702","https://openalex.org/W2962702487","https://openalex.org/W2979454998","https://openalex.org/W6637108112","https://openalex.org/W6674201379","https://openalex.org/W6732897755"],"related_works":["https://openalex.org/W4226159237","https://openalex.org/W2181300307","https://openalex.org/W3170723899","https://openalex.org/W1980293270","https://openalex.org/W2887343277","https://openalex.org/W2577389777","https://openalex.org/W2971359735","https://openalex.org/W2513282730","https://openalex.org/W2070347571","https://openalex.org/W1980208555"],"abstract_inverted_index":{"The":[0,85],"main":[1],"focus":[2],"of":[3,10],"this":[4],"paper":[5],"is":[6,42,74,97],"on":[7],"the":[8,31,37,54,71,89,93],"problem":[9],"noisy":[11],"source":[12,20],"coding":[13],"wherein":[14],"observed":[15],"signals":[16],"from":[17,34],"an":[18],"inaccessible":[19],"shall":[21],"be":[22],"compressed.":[23],"To":[24],"that":[25,83],"end,":[26],"rather":[27],"than":[28],"resorting":[29],"to":[30,46],"conventional":[32],"methods":[33],"Rate-Distortion":[35],"theory,":[36],"so-called":[38],"Information":[39],"Bottleneck":[40],"paradigm":[41],"deployed":[43],"in":[44],"order":[45],"obtain":[47],"a":[48,79],"highly":[49,61],"informative":[50],"representing":[51],"signal":[52],"w.r.t.":[53,92],"given":[55],"source.":[56],"An":[57],"efficient,":[58],"generic":[59],"and":[60,88],"flexible":[62],"graph-based":[63],"message":[64],"passing":[65],"routine":[66],"for":[67,82],"clustering,":[68],"known":[69],"as":[70,78,99],"Affinity":[72],"Propagation":[73],"successfully":[75],"applied":[76],"here":[77],"novel":[80],"treatment":[81],"purpose.":[84],"fundamental":[86],"differences":[87],"performance-wise":[90],"comparison":[91],"state-of-the-art":[94],"KL-Means-IB":[95],"algorithm":[96],"provided":[98],"well.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}