{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/learning-hierarchical-graph-neural-networks","title":"Learning Hierarchical Graph Neural Networks for Image Clustering","arxiv_id":"2107.01319","date":"2021-07-03","proceeding":"ICCV 2021 10","authors":["Yifan Xing","Tong He","Tianjun Xiao","Yongxin Wang","Yuanjun Xiong","Wei Xia","David Wipf","Zheng Zhang","Stefano Soatto"],"abstract":"We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities using a training set of images annotated with labels belonging to a disjoint set of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level. Unlike fully unsupervised hierarchical clustering, the choice of grouping and complexity criteria stems naturally from supervision in the training set. The resulting method, Hi-LANDER, achieves an average of 54% improvement in F-score and 8% increase in Normalized Mutual Information (NMI) relative to current GNN-based clustering algorithms. Additionally, state-of-the-art GNN-based methods rely on separate models to predict linkage probabilities and node densities as intermediate steps of the clustering process. In contrast, our unified framework achieves a seven-fold decrease in computational cost. We release our training and inference code at https://github.com/dmlc/dgl/tree/master/examples/pytorch/hilander.","url_abs":"https://arxiv.org/abs/2107.01319v2","url_pdf":"https://arxiv.org/pdf/2107.01319v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-hierarchical-graph-neural-networks","repo_url":"https://github.com/dmlc/dgl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"learning-hierarchical-graph-neural-networks","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hilander","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"learning-hierarchical-graph-neural-networks","repo_url":"https://github.com/djordjened92/cca-gnnclust","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"face-clustering","task_name":"Face Clustering"},{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"image-clustering","task_name":"Image Clustering"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"},{"method_slug":"hi-lander","method_name":"Hi-LANDER"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2107.01319","atlas_url":"https://app.syntology.ai/?focus=2107.01319","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2107.01319"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2107.01319\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2107.01319"},"call":"get_concepts_for_paper(arxiv_id=\"2107.01319\")"}],"by_repo":[{"repo":"dmlc/dgl","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1607.00653","1612.00222","1802.04364","1806.01973","2006.05582","2010.16103"],"harvested_for_calls":[{"arxiv_id":"1607.00653","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.00653"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.00653\")"},{"arxiv_id":"1612.00222","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00222"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00222\")"},{"arxiv_id":"1802.04364","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.04364"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.04364\")"},{"arxiv_id":"1806.01973","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01973"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01973\")"},{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.16103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16103"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16103\")"}]},{"repo":"djordjened92/cca-gnnclust","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"993d82ea6f972e0202b32a3445b4d0d283401704172b2502123a7b61bf8b8d24","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}