Revision as of 10:49, 10 April 2008 by Huffmalm (Talk | contribs)

Consider the following set of five 2D data points, which we seek to cluster hierarchically.

Lecture23ClustersRaw OldKiwi.jpg

We may visualize the hierarchical clustering in various ways. One is by a Venn diagram, in which we circle the data points which belong to a cluster, then subsequently circle any clusters that belong to a larger cluster in the hierarchy.

Lecture23VennClusters OldKiwi.jpg

Another way is to use a dendogram. A dendogram represents the clustering as a tree, with clusters that are more closely grouped indicated as siblings "earlier" in the tree. The dendogram also includes a "similarity scale," which indicates the distance between the data points (clusters) within a cluster. For the example dataset above (with distances calculated as Euclidian distance), we have the following dendogram:

Lecture23DendogramCluster OldKiwi.jpg

Alumni Liaison

Prof. Math. Ohio State and Associate Dean
Outstanding Alumnus Purdue Math 2008

Jeff McNeal