## Figure 11.
Computation of Clustering Algorithm. The flow chart outlines the steps of the algorithm. The optimal number of clusters
is identified by the number of clusters that maximizes the scoring index. In some
situations the scoring index can be relatively equal for a range of cluster sizes
in which case it is advisable to choose the smallest number of clusters that has a
SI within the 95% confidence interval of the maximum SI. We implement this heuristic
in all examples.
Solovieff |