{"id":"https://openalex.org/W2608064482","doi":"https://doi.org/10.1145/3345951","title":"Comparing Two Clusterings Using Matchings between Clusters of Clusters","display_name":"Comparing Two Clusterings Using Matchings between Clusters of Clusters","publication_year":2019,"publication_date":"2019-10-11","ids":{"openalex":"https://openalex.org/W2608064482","doi":"https://doi.org/10.1145/3345951","mag":"2608064482"},"language":"en","primary_location":{"id":"doi:10.1145/3345951","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3345951","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.inria.fr/hal-01514872","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029454516","display_name":"Fr\u00e9d\u00e9ric Cazals","orcid":"https://orcid.org/0000-0003-2735-6755"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"F. Cazals","raw_affiliation_strings":["Universit\u00e9 C\u00f4te d'Azur, Inria, France","Algorithms, Biology, Structure"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 C\u00f4te d'Azur, Inria, France","institution_ids":[]},{"raw_affiliation_string":"Algorithms, Biology, Structure","institution_ids":["https://openalex.org/I4210099593"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067914789","display_name":"Dorian Mazauric","orcid":"https://orcid.org/0000-0002-5589-1889"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"D. Mazauric","raw_affiliation_strings":["Universit\u00e9 C\u00f4te d'Azur, Inria, France","Algorithms, Biology, Structure"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 C\u00f4te d'Azur, Inria, France","institution_ids":[]},{"raw_affiliation_string":"Algorithms, Biology, Structure","institution_ids":["https://openalex.org/I4210099593"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108616715","display_name":"Romain Tetley","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Tetley","raw_affiliation_strings":["Universit\u00e9 C\u00f4te d'Azur, Inria, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 C\u00f4te d'Azur, Inria, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001897583","display_name":"R\u00e9mi Watrigant","orcid":"https://orcid.org/0000-0002-6243-5910"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"R. Watrigant","raw_affiliation_strings":["University Lyon, CNRS, ENS de Lyon, Universit\u00e9 Claude Bernard Lyon 1, LIP UMR5668, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Lyon, CNRS, ENS de Lyon, Universit\u00e9 Claude Bernard Lyon 1, LIP UMR5668, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I100532134","https://openalex.org/I1294671590","https://openalex.org/I113428412"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6065,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68614895,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996999979019165,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996999979019165,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9965000152587891,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6833093166351318},{"id":"https://openalex.org/keywords/jaccard-index","display_name":"Jaccard index","score":0.657683789730072},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5573216080665588},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5531512498855591},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.5422055125236511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5336492657661438},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5120297074317932},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5012218952178955},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.4910705089569092},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4657045006752014},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43616488575935364},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42689618468284607},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4240621328353882},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3584633469581604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3435903489589691},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3244069814682007},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3000609278678894},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.2300904095172882}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6833093166351318},{"id":"https://openalex.org/C203519979","wikidata":"https://www.wikidata.org/wiki/Q865360","display_name":"Jaccard index","level":3,"score":0.657683789730072},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5573216080665588},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5531512498855591},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.5422055125236511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5336492657661438},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5120297074317932},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5012218952178955},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.4910705089569092},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4657045006752014},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43616488575935364},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42689618468284607},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4240621328353882},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3584633469581604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3435903489589691},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3244069814682007},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3000609278678894},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.2300904095172882},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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":3,"locations":[{"id":"doi:10.1145/3345951","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3345951","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01514872v2","is_oa":true,"landing_page_url":"https://hal.inria.fr/hal-01514872","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/hal-01514872","raw_type":"\\ninfo:eu-repo/semantics/report\\n"},{"id":"pmh:oai:HAL:hal-02425599v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-02425599","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":"ACM Journal of Experimental Algorithmics, 2019, 24 (1), pp.1-41. ⟨10.1145/3345951⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01514872v2","is_oa":true,"landing_page_url":"https://hal.inria.fr/hal-01514872","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/hal-01514872","raw_type":"\\ninfo:eu-repo/semantics/report\\n"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2113015678","display_name":null,"funder_award_id":"ANR-19-P3IA-0002","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W186403072","https://openalex.org/W1484746756","https://openalex.org/W1519147138","https://openalex.org/W1982202832","https://openalex.org/W2003144493","https://openalex.org/W2013850148","https://openalex.org/W2016500120","https://openalex.org/W2022686119","https://openalex.org/W2030347560","https://openalex.org/W2038225707","https://openalex.org/W2049206926","https://openalex.org/W2071016718","https://openalex.org/W2071949631","https://openalex.org/W2084224084","https://openalex.org/W2099111195","https://openalex.org/W2109904733","https://openalex.org/W2122466336","https://openalex.org/W2132914434","https://openalex.org/W2141729166","https://openalex.org/W2143668817","https://openalex.org/W2148733241","https://openalex.org/W2152986618","https://openalex.org/W2153233077","https://openalex.org/W2157305458","https://openalex.org/W2160555827","https://openalex.org/W2165835468","https://openalex.org/W2189625117","https://openalex.org/W2340541605","https://openalex.org/W2401610261","https://openalex.org/W2477765720","https://openalex.org/W2478708596","https://openalex.org/W2575917280","https://openalex.org/W2613308084","https://openalex.org/W2883701177","https://openalex.org/W3017143921","https://openalex.org/W3099831365","https://openalex.org/W3125164951","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W4241767317","https://openalex.org/W2188840951","https://openalex.org/W2101637161","https://openalex.org/W2908738889","https://openalex.org/W2056194206","https://openalex.org/W2171610853","https://openalex.org/W3092684173","https://openalex.org/W2160785859","https://openalex.org/W2551482053","https://openalex.org/W4280580511"],"abstract_inverted_index":{"Clustering":[0],"is":[1,76,121],"a":[2,27,65,77,83,207,218],"fundamental":[3],"problem":[4,133],"in":[5,99],"data":[6],"science,":[7],"yet":[8],"the":[9,24,88,95,101,104,106,109,116,122,129,139,143,146,150,202,213,227,240],"variety":[10],"of":[11,26,68,79,91,118,124,145,152,168,183,204,229,242],"clustering":[12,20,29,219],"methods":[13,69],"and":[14,35,51,115,160,164,220],"their":[15],"sensitivity":[16],"to":[17,36],"parameters":[18],"make":[19],"hard.":[21],"To":[22],"analyze":[23],"stability":[25],"given":[28],"algorithm":[30],"while":[31],"varying":[32],"its":[33],"parameters,":[34],"compare":[37],"clusters":[38,151,216],"yielded":[39],"by":[40,63,149],"different":[41],"algorithms,":[42],"several":[43],"comparison":[44,236],"schemes":[45],"based":[46],"on":[47,134,142,212],"matchings,":[48],"information":[49,211],"theory,":[50],"various":[52],"indices":[53],"(Rand,":[54],"Jaccard)":[55],"have":[56],"been":[57],"developed.":[58],"We":[59,127],"go":[60],"beyond":[61],"these":[62],"providing":[64,210],"novel":[66],"class":[67],"computing":[70],"meta-clusters":[71],"within":[72,217],"each":[73],"clustering\u2014a":[74],"meta-cluster":[75],"group":[78],"clusters,":[80,105,114],"together":[81],"with":[82,137],"matching":[84],"between":[85,112,215],"these.":[86],"Let":[87],"intersection":[89,111,135],"graph":[90,98,147],"two":[92,113,222],"clusterings":[93],"be":[94],"edge-weighted":[96],"bipartite":[97],"which":[100],"nodes":[102],"represent":[103,108],"edges":[107],"nonempty":[110],"weight":[117],"an":[119],"edge":[120],"number":[123],"common":[125],"items.":[126],"introduce":[128],"so-called":[130],"D":[131,138,205],"-family-matching":[132],"graphs,":[136],"upper":[140],"bound":[141],"diameter":[144],"induced":[148],"any":[153],"meta-cluster.":[154],"First":[155],"we":[156,172,189],"prove":[157,190],"NP":[158],"-completeness":[159],"APX":[161],"-hardness":[162],"results,":[163],"unbounded":[165],"approximation":[166],"ratio":[167],"simple":[169],"strategies.":[170],"Second,":[171],"design":[173],"exact":[174],"polynomial":[175],"time":[176],"dynamic":[177],"programming":[178],"algorithms":[179,195],"for":[180,196],"some":[181],"classes":[182],"graphs":[184],"(in":[185],"particular":[186],"trees).":[187],"Then":[188],"spanning":[191],"tree\u2013based":[192],"efficient":[193],"heuristic":[194],"general":[197],"graphs.":[198],"Our":[199],"experiments":[200],"illustrate":[201],"role":[203],"as":[206,239],"scale":[208],"parameter":[209],"relationship":[214],"in-between":[221],"clusterings.":[223],"They":[224],"also":[225],"show":[226],"advantages":[228],"our":[230],"built-in":[231],"mapping":[232],"over":[233],"classical":[234],"cluster":[235],"measures":[237],"such":[238],"variation":[241],"information.":[243]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-20T22:02:38.213706","created_date":"2025-10-10T00:00:00"}