Classify a set of observations into k clusters using the kmeans algorithm.
The algorithm attempts to minimize the Euclidian distance between observations and centroids. Several initialization methods are included.
Parameters :  data : ndarray
k : int or ndarray
iter : int
thresh : float
minit : string


Returns :  centroid : ndarray
label : ndarray
