{"id":"https://openalex.org/W2948731898","doi":"https://doi.org/10.24963/ijcai.2019/286","title":"Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering","display_name":"Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering","publication_year":2019,"publication_date":"2019-07-28","ids":{"openalex":"https://openalex.org/W2948731898","doi":"https://doi.org/10.24963/ijcai.2019/286","mag":"2948731898"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2019/286","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/286","pdf_url":"https://www.ijcai.org/proceedings/2019/0286.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2019/0286.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066588071","display_name":"Bertrand Charpentier","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bertrand Charpentier","raw_affiliation_strings":["Technical University of Munich"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020404511","display_name":"Thomas Bonald","orcid":"https://orcid.org/0000-0003-0468-0384"},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thomas Bonald","raw_affiliation_strings":["Telecom ParisTech"],"affiliations":[{"raw_affiliation_string":"Telecom ParisTech","institution_ids":["https://openalex.org/I12356871"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066588071"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.15635395,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.43766482,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"2067","last_page":"2073"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9958000183105469,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9939000010490417,"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.5811856389045715},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.573976457118988},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5387232303619385},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49387699365615845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45964479446411133},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4355294108390808},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.41829168796539307},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40799272060394287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3798213005065918},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2977113425731659},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14076665043830872}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5811856389045715},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.573976457118988},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5387232303619385},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49387699365615845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45964479446411133},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4355294108390808},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.41829168796539307},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40799272060394287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3798213005065918},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2977113425731659},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14076665043830872}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2019/286","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/286","pdf_url":"https://www.ijcai.org/proceedings/2019/0286.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2019/286","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/286","pdf_url":"https://www.ijcai.org/proceedings/2019/0286.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2948731898.pdf"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W2016621483","https://openalex.org/W2021969242","https://openalex.org/W2089458547","https://openalex.org/W2095293504","https://openalex.org/W2098509290","https://openalex.org/W2103135182","https://openalex.org/W2118608338","https://openalex.org/W2127795553","https://openalex.org/W2145544171","https://openalex.org/W2157082398","https://openalex.org/W2542513214","https://openalex.org/W2606287509","https://openalex.org/W2752002846","https://openalex.org/W2768882697","https://openalex.org/W2771035597","https://openalex.org/W2949972983","https://openalex.org/W2951747536","https://openalex.org/W2963737091","https://openalex.org/W2964214140","https://openalex.org/W2964282455"],"related_works":["https://openalex.org/W3200375535","https://openalex.org/W2902549273","https://openalex.org/W2981001626","https://openalex.org/W2357738827","https://openalex.org/W1602287844","https://openalex.org/W1966383678","https://openalex.org/W2486717996","https://openalex.org/W3107197685","https://openalex.org/W33990053","https://openalex.org/W2790184291"],"abstract_inverted_index":{"We":[0,176],"introduce":[1],"the":[2,12,15,39,44,52,69,75,91,95,98,107,118,142,154,170,178],"tree":[3,32,99,151],"sampling":[4,61],"divergence":[5,46],"(TSD),":[6],"an":[7],"information-theoretic":[8],"metric":[9,77],"for":[10],"assessing":[11],"quality":[13],"of":[14,18,24,38,54,68,74,85,102,128,159,169,173,180],"hierarchical":[16,22,123,171],"clustering":[17,23],"a":[19,25,31,121,149,166,174],"graph.":[20,40,70,175],"Any":[21],"graph":[26,86,96,119,160],"can":[27,144],"be":[28,145],"represented":[29],"as":[30,163],"whose":[33],"nodes":[34,53],"correspond":[35],"to":[36,93,134,147,164,183],"clusters":[37],"The":[41],"TSD":[42,108,129,143,181],"is":[43,78,81,109,114,130],"Kullback-Leibler":[45],"between":[47],"two":[48],"probability":[49],"distributions":[50],"over":[51],"this":[55],"tree:":[56],"those":[57],"induced":[58],"respectively":[59],"by":[60],"at":[62],"random":[63],"edges":[64],"and":[65,192],"node":[66],"pairs":[67],"A":[71],"fundamental":[72],"property":[73,127],"proposed":[76],"that":[79,131],"it":[80,89,132],"interpretable":[82],"in":[83,100,157],"terms":[84,101,158],"reconstruction.":[87],"Specifically,":[88],"quantifies":[90],"ability":[92],"reconstruct":[94],"from":[97],"information":[103,155],"loss.":[104],"In":[105,140],"particular,":[106,141],"maximum":[110],"when":[111,117],"perfect":[112],"reconstruction":[113],"feasible,":[115],"i.e.,":[116],"has":[120],"complete":[122],"structure.":[124],"Another":[125],"key":[126],"applies":[133],"any":[135],"tree,":[136],"not":[137],"necessarily":[138],"binary.":[139],"used":[146],"compress":[148],"binary":[150],"while":[152],"minimizing":[153],"loss":[156],"reconstruction,":[161],"so":[162],"get":[165],"compact":[167],"representation":[168],"structure":[172],"illustrate":[177],"behavior":[179],"compared":[182],"existing":[184],"metrics":[185],"on":[186,189],"experiments":[187],"based":[188],"both":[190],"synthetic":[191],"real":[193],"datasets.":[194]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}