October 2017
Beginner to intermediate
572 pages
26h 1m
English
k-means clustering is a method of partitioning clustering. The goal of the algorithm is to partition n objects into k clusters, where each object belongs to the cluster with the nearest mean. The objective of the algorithm is to minimize the Within-cluster Sum of Squares (WCSS). Assuming x is the given set of observations, S = denotes k partitions, and is the mean of , then we can formulate the WCSS function as follows:

The process of k-means clustering can be illustrated by the following five steps:
Read now
Unlock full access