Browse State-of-the-Art › Vector Quantization (k-means problem)
Vector Quantization (k-means problem)
5 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
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 ∈X to the respective nearest c ∈C is as small as possible. This is also known as the k-means problem and is known to be NP-hard.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 5 · with a code link: 5 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 5 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 5 of 5, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
28 Jun 2020 2 repositories listedThis superior performance was maintained even when comparing the best result of ten runs for all other algorithms to a single run of breathing k-means, highlighting its effectiveness and speed.
-
8 Feb 2016 2 repositories listedWe propose a novel accelerated exact k-means algorithm, which performs better than the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3 times faster.
-
5 Sep 2023 1 repository listedHierarchical Agglomerative Clustering (HAC) is likely the earliest and most flexible clustering method, because it can be used with many distances, similarities, and various linkage strategies.
-
25 Feb 2023 1 repository listedk-nn search in an rpForest is influenced by two factors: 1) the dispersion of points along the random direction and 2) the number of rpTrees in the rpForest.
-
1 Dec 2003 1 repository listedThe G-means algorithm is based on a statistical test for the hypothesis that a subset of data follows a Gaussian distribution.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections