{"about":{"site":"https://codewithpapers.app","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.","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"},"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":{"atlas_url":"https://app.syntology.ai/?focus=1602.02514","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}