{"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/fast-k-means-with-accurate-bounds","title":"Fast K-Means with Accurate Bounds","arxiv_id":"1602.02514","date":"2016-02-08","proceeding":null,"authors":["James Newling","François Fleuret"],"abstract":"We propose a novel accelerated exact k-means algorithm, which performs better\nthan the current state-of-the-art low-dimensional algorithm in 18 of 22\nexperiments, running up to 3 times faster. We also propose a general\nimprovement of existing state-of-the-art accelerated exact k-means algorithms\nthrough better estimates of the distance bounds used to reduce the number of\ndistance calculations, and get a speedup in 36 of 44 experiments, up to 1.8\ntimes faster.\n  We have conducted experiments with our own implementations of existing\nmethods to ensure homogeneous evaluation of performance, and we show that our\nimplementations perform as well or better than existing available\nimplementations. Finally, we propose simplified variants of standard approaches\nand show that they are faster than their fully-fledged counterparts in 59 of 62\nexperiments.","url_abs":"http://arxiv.org/abs/1602.02514v6","url_pdf":"http://arxiv.org/pdf/1602.02514v6.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":"fast-k-means-with-accurate-bounds","repo_url":"https://github.com/idiap/eakmeans","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"fast-k-means-with-accurate-bounds","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"},{"task_slug":"vector-quantization-k-means-problem","task_name":"Vector Quantization (k-means problem)"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.02514","atlas_url":"https://app.syntology.ai/?focus=1602.02514","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":"1602.02514"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.02514\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.02514"},"call":"get_concepts_for_paper(arxiv_id=\"1602.02514\")"}],"by_repo":[{"repo":"idiap/eakmeans","kind":"official","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":"cc779863445d2f08c91a3914ded4289b77c22d0b5ebc5d6fbf9b25702cba8b6b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}