{"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/modern-hierarchical-agglomerative-clustering","title":"Modern hierarchical, agglomerative clustering algorithms","arxiv_id":"1109.2378","date":"2011-09-12","proceeding":null,"authors":["Daniel Müllner"],"abstract":"This paper presents algorithms for hierarchical, agglomerative clustering\nwhich perform most efficiently in the general-purpose setup that is given in\nmodern standard software. Requirements are: (1) the input data is given by\npairwise dissimilarities between data points, but extensions to vector data are\nalso discussed (2) the output is a \"stepwise dendrogram\", a data structure\nwhich is shared by all implementations in current standard software. We present\nalgorithms (old and new) which perform clustering in this setting efficiently,\nboth in an asymptotic worst-case analysis and from a practical point of view.\nThe main contributions of this paper are: (1) We present a new algorithm which\nis suitable for any distance update scheme and performs significantly better\nthan the existing algorithms. (2) We prove the correctness of two algorithms by\nRohlf and Murtagh, which is necessary in each case for different reasons. (3)\nWe give well-founded recommendations for the best current algorithms for the\nvarious agglomerative clustering schemes.","url_abs":"http://arxiv.org/abs/1109.2378v1","url_pdf":"http://arxiv.org/pdf/1109.2378v1.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":"modern-hierarchical-agglomerative-clustering","repo_url":"https://github.com/UCLOrengoGroup/cath-tools","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"modern-hierarchical-agglomerative-clustering","repo_url":"https://github.com/elki-project/elki","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1109.2378","atlas_url":"https://app.syntology.ai/?focus=1109.2378","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":"1109.2378"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1109.2378\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1109.2378"},"call":"get_concepts_for_paper(arxiv_id=\"1109.2378\")"}],"by_repo":[{"repo":"UCLOrengoGroup/cath-tools","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"elki-project/elki","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1902.03616"],"harvested_for_calls":[{"arxiv_id":"1902.03616","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1902.03616"},"call":"get_harvested_code_for_paper(arxiv_id=\"1902.03616\")"}]}],"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":"00a8dabd97e0d1bb0c1083efcdcade9bb099205d7d4fcadc15c2ecd969d8f54d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}