{"id":"https://openalex.org/W4393380088","doi":"https://doi.org/10.1109/ieeeconf59524.2023.10476840","title":"Constrained Hierarchical Clustering via Graph Coarsening and Optimal Cuts","display_name":"Constrained Hierarchical Clustering via Graph Coarsening and Optimal Cuts","publication_year":2023,"publication_date":"2023-10-29","ids":{"openalex":"https://openalex.org/W4393380088","doi":"https://doi.org/10.1109/ieeeconf59524.2023.10476840"},"language":"en","primary_location":{"id":"doi:10.1109/ieeeconf59524.2023.10476840","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ieeeconf59524.2023.10476840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 57th Asilomar Conference on Signals, Systems, and Computers","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/A5093452718","display_name":"Eliabelle Mauduit","orcid":null},"institutions":[{"id":"https://openalex.org/I201181511","display_name":"\u00c9cole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es","ror":"https://ror.org/0309cs235","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Eliabelle Mauduit","raw_affiliation_strings":["Unité de Mathématiques Appliquées, Institut Polytechnique de Paris,ENSTA Paris,Palaiseau,France,91120"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Unité de Mathématiques Appliquées, Institut Polytechnique de Paris,ENSTA Paris,Palaiseau,France,91120","institution_ids":["https://openalex.org/I201181511"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019172720","display_name":"Andrea Simonetto","orcid":"https://orcid.org/0000-0003-2923-3361"},"institutions":[{"id":"https://openalex.org/I201181511","display_name":"\u00c9cole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es","ror":"https://ror.org/0309cs235","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Andrea Simonetto","raw_affiliation_strings":["Unité de Mathématiques Appliquées, Institut Polytechnique de Paris,ENSTA Paris,Palaiseau,France,91120"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Unité de Mathématiques Appliquées, Institut Polytechnique de Paris,ENSTA Paris,Palaiseau,France,91120","institution_ids":["https://openalex.org/I201181511"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19118865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"400","issue":null,"first_page":"844","last_page":"848"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9715999960899353,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9660999774932861,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.646557629108429},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6413771510124207},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4768030345439911},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.4670048952102661},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41773465275764465},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1882680058479309}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.646557629108429},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6413771510124207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4768030345439911},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.4670048952102661},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41773465275764465},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1882680058479309}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ieeeconf59524.2023.10476840","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ieeeconf59524.2023.10476840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 57th Asilomar Conference on Signals, Systems, and Computers","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04338752v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04338752","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Asilomar Conference on Signals, Systems, and Computers, Oct 2023, Pacific Grove, United States","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W596517489","https://openalex.org/W1576123718","https://openalex.org/W1651093245","https://openalex.org/W2056187338","https://openalex.org/W2087424554","https://openalex.org/W2124764780","https://openalex.org/W2150926065","https://openalex.org/W2153839362","https://openalex.org/W2159757173","https://openalex.org/W2403445823","https://openalex.org/W2532299646","https://openalex.org/W2740780589","https://openalex.org/W2786487292","https://openalex.org/W2952733303","https://openalex.org/W2960658350","https://openalex.org/W2963594156","https://openalex.org/W2963737091","https://openalex.org/W2964319694","https://openalex.org/W2995395573","https://openalex.org/W3121792421","https://openalex.org/W3121920480","https://openalex.org/W3210419330","https://openalex.org/W4205522520","https://openalex.org/W4229641819","https://openalex.org/W4237407686","https://openalex.org/W4240098378","https://openalex.org/W4323266540","https://openalex.org/W6637231022","https://openalex.org/W6751561700","https://openalex.org/W6758192066"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W3200375535"],"abstract_inverted_index":{"Motivated":[0],"by":[1,67,105],"extracting":[2],"and":[3,17,41,50,129],"summarizing":[4],"relevant":[5],"information":[6],"in":[7,26,71],"short":[8],"sentence":[9],"settings,":[10],"such":[11],"as":[12,75],"satisfaction":[13],"questionnaires,":[14],"hotel":[15],"reviews,":[16],"X/Twitter,":[18],"we":[19,32],"study":[20],"the":[21,35,69,82,91,101,112,118],"problem":[22,36,70],"of":[23,37,84],"clustering":[24,38],"words":[25],"a":[27,76,85],"hierarchical":[28,103],"fashion.":[29],"In":[30],"particular,":[31],"focus":[33],"on":[34,111],"with":[39,124],"horizontal":[40,92],"vertical":[42,55],"structural":[43],"constraints.":[44,114],"Horizontal":[45],"constraints":[46,56,59],"are":[47,57,98],"typically":[48],"cannot-link":[49],"must-link":[51],"among":[52,60],"words,":[53],"while":[54],"precedence":[58],"cluster":[61],"levels.":[62],"We":[63,115],"overcome":[64],"state-of-the-art":[65],"bottlenecks":[66],"formulating":[68],"two":[72],"steps:":[73],"first,":[74],"soft-constrained":[77],"regularized":[78],"least-squares":[79],"which":[80],"guides":[81],"result":[83],"sequential":[86],"graph":[87],"coarsening":[88],"algorithm":[89],"towards":[90],"feasible":[93],"set.":[94],"Then,":[95],"flat":[96],"clusters":[97],"extracted":[99],"from":[100],"resulting":[102,119],"tree":[104],"computing":[106],"optimal":[107],"cut":[108],"heights":[109],"based":[110],"available":[113],"show":[116],"that":[117],"approach":[120],"compares":[121],"very":[122],"well":[123],"respect":[125],"to":[126],"existing":[127],"algorithms":[128],"is":[130],"computationally":[131],"light.":[132]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}