The simplest clustering algorithm K means

K-means clustering algorithm General concept of clustering: Assume there are K classes Represent each class with its center Start with some random initial centers Find the best centers for classes, i.e. optimize the centers In classification phase: Find the distance of a new pattern from all centers Find the center whose distance from the new pattern is minimal Classify the new pattern to the class whose center has minimal distance from the pattern