Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Aman, Enver"'
In the Euclidean $k$-means problems we are given as input a set of $n$ points in $\mathbb{R}^d$ and the goal is to find a set of $k$ points $C\subseteq \mathbb{R}^d$, so as to minimize the sum of the squared Euclidean distances from each point in $P$
Externí odkaz:
http://arxiv.org/abs/2405.13877