Reviews in Computational Chemistry Volume 18
Reviews in Computational Chemistry Volume 18
Reviews in Computational Chemistry Volume 18
- No tags were found...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Hierarchy level selection methods provide useful guidance <strong>in</strong> select<strong>in</strong>g<br />
reasonable partitions from hierarchies where the underly<strong>in</strong>g structure of the<br />
data set is unknown. They are, however, a compromise <strong>in</strong> that they compare<br />
entire partitions with each other rather than <strong>in</strong>dividual clusters. In discipl<strong>in</strong>es<br />
outside of chemistry, there is an <strong>in</strong>creas<strong>in</strong>g awareness that such global comparisons<br />
can mask comparative differences <strong>in</strong> local densities. For example, the<br />
situation <strong>in</strong> Figure 5 shows three clusters (below the dendrogram) that cannot<br />
be retrieved by us<strong>in</strong>g a conventional straight horizontal l<strong>in</strong>e across the dendrogram<br />
(such as that shown <strong>in</strong> Figure 1). Us<strong>in</strong>g a straight l<strong>in</strong>e can <strong>in</strong>clude either<br />
item 8 with cluster [3,1,2] but merge [4,5] with [6,7], or keep [4,5] and [6,7]<br />
separate but ma<strong>in</strong>ta<strong>in</strong> 8 as a s<strong>in</strong>gleton. What may be required for the selection<br />
of the ‘‘best,’’ nonoverlapp<strong>in</strong>g clusters from different partitions is a stepped (or<br />
segmental) horizontal l<strong>in</strong>e, which is illustrated by the dotted l<strong>in</strong>e across the<br />
dendrogram <strong>in</strong> Figure 5. No solution to decid<strong>in</strong>g which is the best selection<br />
of nonoverlapp<strong>in</strong>g clusters appears to have been published to date, but there<br />
are examples of methods that are mov<strong>in</strong>g toward a solution. One such example<br />
............................................................................<br />
8<br />
3<br />
1<br />
Progress <strong>in</strong> Cluster<strong>in</strong>g Methodology 27<br />
8 3 1 2 4 5 6 7<br />
2<br />
............................................................................<br />
Figure 5 An illustration of how a stepped hierarchy partition can extract particular<br />
clusters (clusters [8,1,2,3], [4,5], and [6,7], as shown below the hierarchy).<br />
...................<br />
4<br />
6<br />
5<br />
7