Simple KMeans algorithm is implemented in Java to cluster n number of 2-D data points into k number of clusters
- Starting point of the program is App class.
- There are few data points by default you can add as many as possible.
- The program terminates when it reachs max iterations.
- By default the max iterations is 50.
- ClusterHandler handles all the clusters.
- clusterify() is the method to cluster the points.
- prettyPrintClusters() is used to print the clusters on to the console.