{"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/merging-k-means-with-hierarchical-clustering","title":"Merging $K$-means with hierarchical clustering for identifying general-shaped groups","arxiv_id":"1712.08786","date":"2017-12-23","proceeding":null,"authors":["Anna D. Peterson","Arka P. Ghosh","Ranjan Maitra"],"abstract":"Clustering partitions a dataset such that observations placed together in a\ngroup are similar but different from those in other groups. Hierarchical and\n$K$-means clustering are two approaches but have different strengths and\nweaknesses. For instance, hierarchical clustering identifies groups in a\ntree-like structure but suffers from computational complexity in large datasets\nwhile $K$-means clustering is efficient but designed to identify homogeneous\nspherically-shaped clusters. We present a hybrid non-parametric clustering\napproach that amalgamates the two methods to identify general-shaped clusters\nand that can be applied to larger datasets. Specifically, we first partition\nthe dataset into spherical groups using $K$-means. We next merge these groups\nusing hierarchical methods with a data-driven distance measure as a stopping\ncriterion. Our proposal has the potential to reveal groups with general shapes\nand structure in a dataset. We demonstrate good performance on several\nsimulated and real datasets.","url_abs":"http://arxiv.org/abs/1712.08786v1","url_pdf":"http://arxiv.org/pdf/1712.08786v1.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":[],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"density-estimation","task_name":"Density Estimation"},{"task_slug":"speech-synthesis","task_name":"Speech Synthesis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/speech-synthesis-on-north-american-english","task":"Speech Synthesis","dataset":"North American English","model":"means","rank_in_archive_order":7,"of":7,"metrics":{"Mean Opinion Score":"0"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"af51e546810cef3aaf9b2654f90aced2de12ac5ac677ad97488c9a22ce63ff2a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}