{"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/the-k-means-u-algorithm-non-local-jumps-and","title":"The k-means-u* algorithm: non-local jumps and greedy retries improve k-means++ clustering","arxiv_id":"1706.09059","date":"2017-06-27","proceeding":null,"authors":["Bernd Fritzke"],"abstract":"We present a new clustering algorithm called k-means-u* which in many cases\nis able to significantly improve the clusterings found by k-means++, the\ncurrent de-facto standard for clustering in Euclidean spaces. First we\nintroduce the k-means-u algorithm which starts from a result of k-means++ and\nattempts to improve it with a sequence of non-local \"jumps\" alternated by runs\nof standard k-means. Each jump transfers the \"least useful\" center towards the\ncenter with the largest local error, offset by a small random vector. This is\ncontinued as long as the error decreases and often leads to an improved\nsolution. Occasionally k-means-u terminates despite obvious remaining\noptimization possibilities. By allowing a limited number of retries for the\nlast jump it is frequently possible to reach better local minima. The resulting\nalgorithm is called k-means-u* and dominates k-means++ wrt. solution quality\nwhich is demonstrated empirically using various data sets. By construction the\nlogarithmic quality bound established for k-means++ holds for k-means-u* as\nwell.","url_abs":"http://arxiv.org/abs/1706.09059v2","url_pdf":"http://arxiv.org/pdf/1706.09059v2.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":"the-k-means-u-algorithm-non-local-jumps-and","repo_url":"https://github.com/gittar/k-means-u-star","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":[{"repo":"gittar/k-means-u-star","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"05d4d02726c21372a73a90894eb768a1089a2b15fad612a74b521b2eff182313","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}