<li class="level1"><a href="#kmeans-ann">ANN algorithm</a></li>
</ul>
</div>
<div class="textblock"><p>Given \(n\) points \(\bx_1,\dots,\bx_n \in \real^d\), the goal of K-means is find \(K\) <code>centers</code> \(\bc_1,\dots,\bc_m \in \real^d\) and <code>assignments</code> \(q_1,\dots,q_n \in \{1,\dots,K\}\) of the points to the centers such that the sum of distances</p>
<p class="formulaDsp">
\[ E(\bc_1,\dots,\bc_k,q_1,\dots,q_n) = \sum_{i=1}^n \|\bx_i - \bc_{q_i} \|_p^p \]
</p>
<p>is minimized. \(K\)-mea