Clustering algorithms take data and tries to sort it into clusters each with some form of similar characteristics. This is like you might do if looking a scatter graph and noticing that the data falls into two or three groups. Examples of cluster analysis includes k-means which is based around calculating centroids of each cluster and Khonne networks (or aelf-organsing maps) which are a form of neural netwrok where similar data points are classified close to one another a two dimensional grid. Clustering algorithms are a form of unsupevsied learnong, but there are also semi-supervised forms where some or all of the training set has a classification and the clustering algorithm tries to ensure that each cluster has a consistent label, even if there may be several clusters for each label.
Defined on page 136
Used on Chap. 5: page 88; Chap. 6: pages 111, 121, 124; Chap. 7: pages 135, 136, 137, 144, 147; Chap. 8: pages 160, 162, 170; Chap. 9: pages 188, 195; Chap. 10: pages 204, 205, 211; Chap. 12: page 261; Chap. 18: page 442; Chap. 20: pages 508, 510; Chap. 21: pages 527, 530
Also known as clustering algorithm, clustering algorithms, clusters