Dendrograms are a popular visualization tool for representing hierarchical
relationships. In agglomerative clustering, dendrograms can be constructed
using a variety of linkage criterion (such as single or complete linkage),
many of which are frequently used to
visualize the density-based
relationships in the data or
extract cluster labels from the data the
dendrogram represents.
The original ordering algorithm OPTICS as described by Ankerst et al (1999)
introduced the notion of 2-dimensional representation of so-called
density-reachability that was shown to be useful for data visualization.
This representation was shown to essentially convey the same information as
the more traditional dendrogram structure by Sanders et al (2003).
Different hierarchical representations, such as dendrograms or reachability
plots, may be preferable depending on the context. In smaller datasets,
cluster memberships may be more easily identifiable through a dendrogram
representation, particularly is the user is already familiar with tree-like
representations. For larger datasets however, a reachability plot may be
preferred for visualizing macro-level density relationships.
The central idea behind a reachability plot is that the ordering in which
points are plotted identifies underlying hierarchical density
representation. OPTICS linearly orders the data points such that points
which are spatially closest become neighbors in the ordering. Valleys
represent clusters, which can be represented hierarchically. Although the
ordering is crucial to the structure of the reachability plot, its important
to note that OPTICS, like DBSCAN, is not entirely deterministic and, just
like the dendrogram, isomorphisms may exist
A variety of cluster extraction methods have been proposed using
reachability plots. Because both cluster extraction depend directly on the
ordering OPTICS produces, they are part of the optics interface.
Nonetheless, reachability plots can be created directly from other types of
linkage trees, and vice versa.