Tree cutting is an important aspect of hierarchical clustering, however, de-
termining where to cut often poses a problem, as we would like the clusters
to actually represent connections between the objects. An algorithm that
helps us achieve this is pvclust. It generates samples through the bootstrap
method, which are then used to calculate the correlation between pairs of in-
dividual attributes. These values serve as a measure to determine distances
that are crucial in hierarchical clustering. Throughout all iterations, the al-
gorithm compares which clusters are likely to represent actual connections
between features. The only issue is that the algorithm requires a signifi-
cant amount of time to operate. Therefore, in this study, we are exploring
an alternative that could yield similar results while significantly reducing the
required time. Fortunately, it seems that we were able to reproduce sufficient
results using the silhouette method.
|
