9
K-Means Clustering and Density-Based Clustering
This chapter introduces K-means and density-based clustering algorithms that produce nonhierarchical groups of similar data points based on the centroid and density of a cluster, respectively. A list of software packages that support these clustering algorithms is provided. Some applications of these clustering algorithms are given with references.
9.1 K-Means Clustering
Table 9.1 lists the steps of the K-means clustering algorithm. The K-means clustering algorithm starts with a given K value and the initially assigned centroids of the K clusters. The algorithm proceeds by having each of n data points in the data set join its closest cluster and updating the centroids of the clusters ...
Get Data Mining now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.