concept clusterboot in category R

This is an excerpt from Manning's book Practical Data Science with R, Second Edition.
clusterboot’s algorithm uses the Jaccard coefficient, a similarity measure between sets. The Jaccard similarity between two sets A and B is the ratio of the number of elements in the intersection of A and B over the number of elements in the union of A and B. This is shown in figure 9.9.
Let’s run clusterboot() on the protein data, using hierarchical clustering with five clusters. Note that clusterboot() is randomized, so you may not get identical results.
Listing 9.6. Running clusterboot() on the protein data
library(fpc) #1 kbest_p <- 5 #2 cboot_hclust <- clusterboot(pmatrix, clustermethod = hclustCBI, #3 method = "ward.D", k = kbest_p) summary(cboot_hclust$result) #4 ## Length Class Mode ## result 7 hclust list ## noise 1 -none- logical ## nc 1 -none- numeric ## clusterlist 5 -none- list ## partition 25 -none- numeric ## clustermethod 1 -none- character ## nccl 1 -none- numeric groups <- cboot_hclust$result$partition #5 print_clusters(protein, groups, cols_to_print) #6 ## $`1` ## Country RedMeat Fish Fr.Veg ## 1 Albania 10.1 0.2 1.7 ## 4 Bulgaria 7.8 1.2 4.2 ## 18 Romania 6.2 1.0 2.8 ## 25 Yugoslavia 4.4 0.6 3.2 ## ## $`2` ## Country RedMeat Fish Fr.Veg ## 2 Austria 8.9 2.1 4.3 ## 3 Belgium 13.5 4.5 4.0 ## 9 France 18.0 5.7 6.5 ## 12 Ireland 13.9 2.2 2.9 ## 14 Netherlands 9.5 2.5 3.7 ## 21 Switzerland 13.1 2.3 4.9 ## 22 UK 17.4 4.3 3.3 ## 24 W Germany 11.4 3.4 3.8 ## ## $`3` ## Country RedMeat Fish Fr.Veg ## 5 Czechoslovakia 9.7 2.0 4.0 ## 7 E Germany 8.4 5.4 3.6 ## 11 Hungary 5.3 0.3 4.2 ## 16 Poland 6.9 3.0 6.6 ## 23 USSR 9.3 3.0 2.9 ## ## $`4` ## Country RedMeat Fish Fr.Veg ## 6 Denmark 10.6 9.9 2.4 ## 8 Finland 9.5 5.8 1.4 ## 15 Norway 9.4 9.7 2.7 ## 20 Sweden 9.9 7.5 2.0 ## ## $`5` ## Country RedMeat Fish Fr.Veg ## 10 Greece 10.2 5.9 6.5 ## 13 Italy 9.0 3.4 6.7 ## 17 Portugal 6.2 14.2 7.9 ## 19 Spain 7.1 7.0 7.2 cboot_hclust$bootmean #7 ## [1] 0.8090000 0.7939643 0.6247976 0.9366667 0.7815000 cboot_hclust$bootbrd #8 ## [1] 19 14 45 9 30The clusterboot() results show that the cluster of countries with high fish consumption (cluster 4) is highly stable: the cluster stability is high, and the cluster was dissolved relatively few times. Clusters 1 and 2 are also quite stable; cluster 5 less so (you can see in figure 9.8 that the members of cluster 5 are separated from the other countries, but also fairly separated from each other). Cluster 3 has the characteristics of what we’ve been calling the “other” cluster.
clusterboot() assumes that you know the number of clusters, k. We eyeballed the appropriate k from the dendrogram, but this isn’t always feasible with a large dataset. Can we pick a plausible k in a more automated fashion? We’ll look at this question in the next section.
To run kmeans(), you must know k. The fpc package (the same package that has clusterboot()) has a function called kmeansruns() that calls kmeans() over a range of k and estimates the best k. It then returns its pick for the best value of k, the output of kmeans() for that value, and a vector of criterion values as a function of k. Currently, kmeansruns() has two criteria: the Calinski-Harabasz index ("ch") and the average silhouette width ("asw"). For either criterion, the maximum value indicates the optimal number of clusters (for more about silhouette clustering, see http://mng.bz/Qe15). It’s a good idea to examine the criterion values over the entire range of k, since you may see evidence for a k that the algorithm didn’t automatically pick. The following listing illustrates this point.