The k-means clustering method is used in non-hierarchical cluster analysis . The goal is to divide the whole set of objects into a predefined number (k) of clusters. The criteria for such subdivision is normally the minimal dispersion inside clusters – e.g. the minimal sum of squares of the distances from the mean vector ( centroid ) of the cluster. A direct rigorous solution to this problem requires testing of an impractically large number of data subdivisions. The k-means clustering is a fast heuristic method that provides a reasonably good solution, although not optimal.
For more details see the chapter in the XLMiner help .
Browse Other Glossary Entries
Planning on taking an introductory statistics course, but not sure if you need to start at the beginning? Review the course description for each of our introductory statistics courses and estimate which best matches your level, then take the self test for that course. If you get all or almost all the questions correct, move on and take the next test.
Find the right course for you
We'd love to answer your questions
Our mentors and academic advisors are standing by to help guide you towards the courses or program that makes the most sense for you and your goals.
300 W Main St STE 301, Charlottesville, VA 22903