This is a simple program that identifies clusters in a dataset with more than x and y attribute.
- The directory of the data upon which the k means algorithm needs to be implemented. The input data must be stripped of all texts and the first column must include either row number or an unique identifier. This column will not be used in any calculation.
- Maximum number of iterations
- CSV file containing the data separed into its own clusters and 4 line space differentiating the border between each individual clusters.