NN is the same as Lloyd, but uses an approximated
nearest neighbours (ANN) algorithm to accelerate the
sample-to-center comparisons. The latter is particularly
suitable for very large problems.
</p></dd><dt>
NumRepetitions
<span class="defaults">[1]</span></dt><dd><p>
Number of time to restart k-means. The solution with minimal
energy is returned.
</p></dd></dl><p>
The following options tune the KD-Tree forest used for ANN
computations in the ANN algorithm (see also <a href="%pathto:vl_kdtreebuild;">VL_KDTR