{"url":"/task/vector-quantization-k-means-problem","name":"Vector Quantization (k-means problem)","slug":"vector-quantization-k-means-problem","description_markdown":"Given a data set $X$ of d-dimensional numeric vectors and a number $k$ find a codebook $C$ of $k$ d-dimensional vectors such that the sum of square distances of each $x \\in X$ to the respective nearest $c   \\in C$ is as small as possible. This is also known as the k-means problem and is known to be NP-hard.","categories":[{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":5,"papers_with_code":5,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":5,"of":5,"tagged_in_all":5,"items":[{"url":"/paper/breathing-k-means","title":"Breathing K-Means: Superior K-Means Solutions through Dynamic K-Values","date":"2020-06-28","arxiv_id":"2006.15666","repositories_listed":2,"syntology":null},{"url":"/paper/fast-k-means-with-accurate-bounds","title":"Fast K-Means with Accurate Bounds","date":"2016-02-08","arxiv_id":"1602.02514","repositories_listed":2,"syntology":null},{"url":"/paper/data-aggregation-for-hierarchical-clustering","title":"Data Aggregation for Hierarchical Clustering","date":"2023-09-05","arxiv_id":"2309.02552","repositories_listed":1,"syntology":null},{"url":"/paper/the-effect-of-points-dispersion-on-the-k-nn-1","title":"The Effect of Points Dispersion on the $k$-nn Search in Random Projection Forests","date":"2023-02-25","arxiv_id":"2302.13160","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-k-in-k-means","title":"Learning the k in k-means","date":"2003-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}