September 2017
Beginner to intermediate
412 pages
8h 55m
English
Of the several clustering algorithms that we will examine in this chapter, hierarchical clustering is probably the simplest. The trade-off is that it works well only with small datasets in Euclidean space.
The general setup is that we have a dataset S of m points in
which we want to partition into a given number k of clusters C1, C2,..., Ck, where within each cluster the points are relatively close together. (B. J. Frey and D. Dueck, Clustering by Passing Messages Between Data Points Science 315, Feb 16, 2007 http://science.sciencemag.org/content/315/5814/972).
Here is the algorithm:
Read now
Unlock full access