and computer science, Lloyd's algorithm, also known as Voronoi iteration or relaxation, is an algorithm named after Stuart P. Lloyd for finding evenly spaced...
16 KB (1,935 words) - 15:03, 29 April 2025
K-means clustering (redirect from K-means clustering algorithm)
its ubiquity, it is often called "the k-means algorithm"; it is also referred to as Lloyd's algorithm, particularly in the computer science community...
62 KB (7,754 words) - 11:44, 13 March 2025
(training set), such that it will be locally optimal. It combines Lloyd's Algorithm with a splitting technique in which larger codebooks are built from...
3 KB (330 words) - 11:04, 9 January 2024
Cluster analysis (redirect from Clustering algorithm)
well-known approximate method is Lloyd's algorithm, often just referred to as "k-means algorithm" (although another algorithm introduced this name). It does...
75 KB (9,513 words) - 02:05, 30 April 2025
Delaunay triangulation (redirect from Delaunay algorithm)
analysis Hamming bound – sphere-packing bound Linde–Buzo–Gray algorithm Lloyd's algorithm – Voronoi iteration Meyer set Pisot–Vijayaraghavan number Pitteway...
29 KB (3,255 words) - 19:16, 18 March 2025
medoids as centers Linde–Buzo–Gray algorithm: a vector quantization algorithm to derive a good codebook Lloyd's algorithm (Voronoi iteration or relaxation):...
72 KB (7,945 words) - 09:48, 26 April 2025
The Harrow–Hassidim–Lloyd (HHL) algorithm is a quantum algorithm for numerically solving a system of linear equations, designed by Aram Harrow, Avinatan...
36 KB (4,990 words) - 03:25, 18 March 2025
Gale–Shapley algorithm (also known as the deferred acceptance algorithm, propose-and-reject algorithm, or Boston Pool algorithm) is an algorithm for finding...
20 KB (2,622 words) - 16:25, 12 January 2025
Voronoi diagram (section Algorithms)
for use on commodity graphics hardware. Lloyd's algorithm and its generalization via the Linde–Buzo–Gray algorithm (aka k-means clustering) use the construction...
46 KB (5,504 words) - 02:43, 25 March 2025
Vector quantization (category Lossy compression algorithms)
image-to-image translation. Subtopics Linde–Buzo–Gray algorithm (LBG) Learning vector quantization Lloyd's algorithm Growing Neural Gas, a neural network-like system...
13 KB (1,649 words) - 10:50, 3 February 2024
Centroidal Voronoi tessellation (category Geometric algorithms)
of generators. A number of algorithms can be used to generate centroidal Voronoi tessellations, including Lloyd's algorithm for K-means clustering or Quasi-Newton...
4 KB (411 words) - 10:59, 15 January 2024
K-means++ (category Cluster analysis algorithms)
called Lloyd's algorithm or the k-means algorithm) is used widely and frequently finds reasonable solutions quickly. However, the k-means algorithm has at...
11 KB (1,403 words) - 04:59, 19 April 2025
In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the...
39 KB (4,560 words) - 14:59, 23 April 2025
David Mount (category Researchers in geometric algorithms)
developing practical algorithms for k-means clustering, a problem known to be NP-hard. The most common algorithm used is Lloyd's algorithm, which is heuristic...
8 KB (1,043 words) - 13:08, 5 January 2025
machine precision. The Baum–Welch algorithm was named after its inventors Leonard E. Baum and Lloyd R. Welch. The algorithm and the Hidden Markov models were...
28 KB (3,896 words) - 21:05, 1 April 2025
this is an NP-hard problem requiring heuristic solutions such as Lloyd's algorithm, but in a network space it can be solved deterministically. Particular...
13 KB (1,503 words) - 12:37, 27 June 2024
acid, a fatty acid Linde–Buzo–Gray algorithm (also called Generalized Lloyd Algorithm), a vector quantization algorithm Gla, a Mycenaean fortification in...
2 KB (222 words) - 09:35, 3 February 2025
of points (e.g., customer locations). A commonly used example is Lloyd's algorithm. Distance matrix, an array containing the distances (Euclidean or...
7 KB (819 words) - 15:13, 19 December 2023
Farthest-first traversal (category Approximation algorithms)
differs in the choice of which Voronoi vertex to insert at each step. Lloyd's algorithm, a different method for generating evenly spaced points in geometric...
28 KB (3,123 words) - 06:53, 11 March 2024
same duality can also be used in finite element mesh generation. Lloyd's algorithm, a method based on Voronoi diagrams for moving a set of points on...
51 KB (6,607 words) - 00:16, 3 April 2025
popular for quadrilateral meshes, for which other methods such as Lloyd's algorithm for triangular mesh smoothing are less applicable. In this method...
15 KB (2,010 words) - 15:38, 30 January 2025
Smoothed analysis (category Analysis of algorithms)
with small pairwise distances between points in the same cluster. Lloyd's algorithm is widely used and very fast in practice, although it can take e Ω...
13 KB (1,727 words) - 05:13, 3 November 2024
The quantum least-squares fitting algorithm makes use of a version of Harrow, Hassidim, and Lloyd's quantum algorithm for linear systems of equations (HHL)...
25 KB (3,576 words) - 17:39, 29 March 2025
In numerical linear algebra, the QR algorithm or QR iteration is an eigenvalue algorithm: that is, a procedure to calculate the eigenvalues and eigenvectors...
27 KB (4,226 words) - 04:59, 24 April 2025
In numerical analysis, the Kahan summation algorithm, also known as compensated summation, significantly reduces the numerical error in the total obtained...
27 KB (3,525 words) - 00:04, 21 April 2025
Quantum computing (redirect from Quantum search algorithms)
1996, Grover's algorithm established a quantum speedup for the widely applicable unstructured search problem. The same year, Seth Lloyd proved that quantum...
113 KB (12,418 words) - 11:20, 1 May 2025
(TTC) is an algorithm for trading indivisible items without using money. It was developed by David Gale and published by Herbert Scarf and Lloyd Shapley.: 30–31 ...
13 KB (1,738 words) - 07:40, 21 January 2025
K q-flats (category Cluster analysis algorithms)
a_{j}} to F l {\displaystyle F_{l}} . The algorithm is similar to the k-means algorithm (i.e. Lloyd's algorithm) in that it alternates between cluster assignment...
13 KB (2,218 words) - 15:11, 17 August 2024
Eulerian path (redirect from Fleury's algorithm)
component of the underlying undirected graph. Fleury's algorithm is an elegant but inefficient algorithm that dates to 1883. Consider a graph known to have...
28 KB (3,296 words) - 06:19, 16 March 2025
locales Leukaemia & Lymphoma Research Lloyd's Law Reports Log-likelihood ratio Lucas–Lehmer–Riesel test, an algorithm to find the primality of a number of...
736 bytes (129 words) - 08:17, 24 December 2024