Daniel Diaz
Alejandro Suarez
Clustering is the task of arrangement a set of objects so that objects in the identical group are more related to each other than to those in other groups (clusters). The clustering is unsupervised learning.
Describe in a computational model:
k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster.
The Κ-means clustering algorithm uses iterative refinement to produce a final result.
The algorithms starts with initial estimates for the Κ centroids, which can either be randomly generated or randomly selected from the data set.
Each centroid defines one of the clusters. Each data point is assigned to its nearest centroid, based on the squared Euclidean distance.
The centroids are recomputed. This is done by taking the mean of all data points assigned to that centroid's cluster.
Makes no assumptions on the shapes of clusters, can handle intertwined spirals, etc.