Splits the points in the array into k clusters by nearest centre. One
label per row, in the order you gave the points.
Details
k-means always produces exactly k clusters and no noise, so it labels
every point. It favours round, similarly sized clusters; use ga_dbscan()
when the shapes are irregular or the count is unknown.
ga_kmeans() clusters over the whole array, not within each row, so k is
a single value rather than one per row. The algorithm starts from a random
seed, so ga_kmeans() can return different results on each run unless you
give seed. It leaves a row that is not a single point, or is null, out of
the clustering and returns null for it.
See also
Other cluster:
ga_dbscan(),
ga_outlier_scores()