/ol>
</li>
</ol>
<h1><a class="anchor" id="kmeans-ann"></a>
ANN algorithm</h1>
<p>The <em>Approximate Nearest Neighbor</em> (ANN) K-means algorithm <a class="el" href="citelist.html#CITEREF_beis97shape">[4]</a> <a class="el" href="citelist.html#CITEREF_silpa-anan08optimised">[27]</a> <a class="el" href="citelist.html#CITEREF_muja09fast">[21]</a> is a variant of Lloyd's algorithm (<a class="el" href="kmeans-fundamentals.html#kmeans-lloyd">Lloyd's algorithm</a>) uses a best-bin-first randomized KD-tree algori