Discovering groups of data using K-Means clustering
One of the most popular and well-known clustering methods is K-Means clustering. It's conceptually simple. It's also easy to implement and is computationally cheap. We can get decent results quickly for many different datasets.
On the downside, it sometimes gets stuck in local optima and misses a better solution.
Generally, K-Means clustering performs best when groups in the data are spatially distinct and are grouped into separate circles. If the clusters are all mixed, this won't be able to distinguish them. This means that if the natural groups in the data overlap, the clusters that K-Means generates will not properly distinguish the natural groups in the data.
Getting ready
For this recipe, we'll need the same dependencies in our project.clj file that we used in the Loading CSV and ARFF files into Weka recipe.
However, we'll need a slightly different set of imports in our script or REPL:
(import [weka.core EuclideanDistance...
