{"id":"https://openalex.org/W3128344064","doi":"https://doi.org/10.1109/isit45174.2021.9517814","title":"On Greedy Approaches to Hierarchical Aggregation","display_name":"On Greedy Approaches to Hierarchical Aggregation","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3128344064","doi":"https://doi.org/10.1109/isit45174.2021.9517814","mag":"3128344064"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9517814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2102.01730","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001767879","display_name":"Alexandra Porter","orcid":"https://orcid.org/0000-0002-8163-4157"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alexandra Porter","raw_affiliation_strings":["Stanford University,Department of Computer Science,Stanford,CA","Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Stanford University,Department of Computer Science,Stanford,CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022963784","display_name":"Mary Wootters","orcid":"https://orcid.org/0000-0002-2345-2531"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mary Wootters","raw_affiliation_strings":["Stanford University,Departments of Computer Science and Electrical Engineering,Stanford,CA","Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Stanford University,Departments of Computer Science and Electrical Engineering,Stanford,CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001767879"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.14,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51988869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2649","last_page":"2654"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9998999834060669,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9998999834060669,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.9786999821662903,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9664000272750854,"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/heuristics","display_name":"Heuristics","score":0.7997991442680359},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.792546272277832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6251925230026245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5215473175048828},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4945699870586395},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.48219695687294006},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4412826597690582},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4158453643321991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3743347227573395},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35154345631599426},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3271867632865906},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26644542813301086}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7997991442680359},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.792546272277832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6251925230026245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5215473175048828},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4945699870586395},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.48219695687294006},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4412826597690582},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4158453643321991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3743347227573395},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35154345631599426},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3271867632865906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26644542813301086},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit45174.2021.9517814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2102.01730","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2102.01730","pdf_url":"https://arxiv.org/pdf/2102.01730","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3128344064","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2102.01730","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2102.01730","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2102.01730","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2102.01730","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2102.01730","pdf_url":"https://arxiv.org/pdf/2102.01730","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1429924680","display_name":null,"funder_award_id":"CCF-1657049","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2499887605","display_name":null,"funder_award_id":"DGE-1656518","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G320138474","display_name":null,"funder_award_id":"-1656518","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5155150688","display_name":null,"funder_award_id":"CCF-1844628","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5267932457","display_name":null,"funder_award_id":"1656518","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6451375130","display_name":"CAREER: New Fundamentals in Coding Theory","funder_award_id":"1844628","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7221065200","display_name":"CRII: CIF: Locality in Error Correcting Codes: Fundamental Trade-Offs","funder_award_id":"1657049","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3128344064.pdf","grobid_xml":"https://content.openalex.org/works/W3128344064.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1994473607","https://openalex.org/W2043260929","https://openalex.org/W2108614537","https://openalex.org/W2110210487","https://openalex.org/W2116341502","https://openalex.org/W2123976939","https://openalex.org/W2155461593","https://openalex.org/W2519887557","https://openalex.org/W2624431344","https://openalex.org/W2766453196","https://openalex.org/W2948065180","https://openalex.org/W2951659295","https://openalex.org/W2962767366","https://openalex.org/W2963224980","https://openalex.org/W6726873649","https://openalex.org/W6738964360","https://openalex.org/W6753331806","https://openalex.org/W6763738389","https://openalex.org/W6790490783"],"related_works":["https://openalex.org/W3196768793","https://openalex.org/W2111826485","https://openalex.org/W1522510201","https://openalex.org/W2784412932","https://openalex.org/W2037842665","https://openalex.org/W2049687735","https://openalex.org/W2154908766","https://openalex.org/W2776183083","https://openalex.org/W3204684126","https://openalex.org/W2950865888","https://openalex.org/W2917720955","https://openalex.org/W1558032106","https://openalex.org/W3211364598","https://openalex.org/W2913890173","https://openalex.org/W2987833820","https://openalex.org/W39130988","https://openalex.org/W2888920258","https://openalex.org/W2983456831","https://openalex.org/W2136192098","https://openalex.org/W2736305340"],"abstract_inverted_index":{"We":[0,72,92,119],"analyze":[1],"greedy":[2,60,96,124,148,157],"algorithms":[3],"for":[4,19,62,85],"the":[5,53,63,110,129,155],"Hierarchical":[6],"Aggregation":[7],"(HAG)":[8],"problem,":[9],"a":[10,59,68,88,106,122],"strategy":[11],"introduced":[12,58],"in":[13,38,117,140],"[Jia":[14],"et":[15],"al.,":[16],"KDD":[17],"2020]":[18],"speeding":[20],"up":[21],"learning":[22],"on":[23,166],"Graph":[24],"Neural":[25],"Networks":[26],"(GNNs).":[27],"The":[28,44],"idea":[29],"of":[30,172],"HAG":[31,64,111],"is":[32,48,78,175],"to":[33,49,136],"identify":[34,50],"and":[35,51,66,81,113,132,159],"remove":[36,52],"redundancies":[37],"computations":[39],"performed":[40],"when":[41],"training":[42],"GNNs.":[43],"associated":[45],"optimization":[46],"problem":[47,65,112],"most":[54],"redundancies.":[55],"Previous":[56],"work":[57],"approach":[61],"claimed":[67],"1-1/e":[69],"approximation":[70,90,102],"factor.":[71,91],"show":[73,134],"by":[74,104],"example":[75],"that":[76,94,150,162],"this":[77,95,173],"not":[79],"correct,":[80],"one":[82],"cannot":[83],"hope":[84],"better":[86],"than":[87,154],"1/2":[89],"prove":[93],"algorithm":[97,125],"does":[98],"satisfy":[99],"some":[100,141,147],"(weaker)":[101],"guarantee,":[103],"showing":[105],"new":[107],"connection":[108],"between":[109],"maximum":[114],"matching":[115],"problems":[116],"hypergraphs.":[118],"also":[120],"introduce":[121,146],"second":[123],"which":[126],"can":[127],"out-perform":[128],"first":[130],"one,":[131],"we":[133,145,160],"how":[135],"implement":[137],"it":[138],"efficiently":[139],"parameter":[142],"regimes.":[143],"Finally,":[144],"heuristics":[149],"are":[151],"much":[152],"faster":[153],"above":[156],"algorithms,":[158],"demonstrate":[161],"they":[163],"perform":[164],"well":[165],"real-world":[167],"graphs.":[168],"A":[169],"full":[170],"version":[171],"paper":[174],"accessible":[176],"at:":[177],"https://arxiv.org/abs/2102.01730":[178]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}