Content deleted Content added
m Reverting possible vandalism by 120.56.204.255 to version by Miym. False positive? Report it. Thanks, ClueBot. (785701) (Bot) |
Adding images of example. |
||
Line 1:
{{multiple image
| align = right
| direction = vertical
| header = Example of Lloyd's algorithm. The Voronoi diagram of the current points at each iteration is shown. The plus signs denote the centroids of the Voronoi cells.
| header_align = center
| header_background =
| footer = In the last image, the points are very near the centroids of the Voronoi cells. A centroidal Voronoi tessellation has been found.
| footer_align = center
| footer_background =
| width = 200
| image1 = LloydsMethodIteration1.png
| alt1 = Lloyd's method, iteration 1
| caption1 = First iteration
| image2 = LloydsMethodIteration2.png
| alt2 = Lloyd's method, iteration 2
| caption2 = Second iteration
| image3 = LloydsMethodIteration3.png
| alt3 = Lloyd's method, iteration 3
| caption3 = Third iteration
| image4 = LloydsMethodIteration15.png
| alt4 = Lloyd's method, iteration 15
| caption4 = Fifteenth iteration
}}
In [[computer science]] and [[electrical engineering]], '''Lloyd's algorithm''', also known as '''Voronoi iteration''' or relaxation, is an algorithm for grouping data points into a given number of categories, used for [[k-means clustering|''k''-means clustering]].
| |||