| agnes | Computes agglomerative hierarchical clustering of the
data set. |
| bannerplot | Draws a “banner,” i.e., basically a horizontal barplot visualizing the (agglomerative
or divisive) hierarchical clustering or another binary
dendrogram structure. |
| clara | Computes a "clara"
object, a list representing a clustering of the data into
k
clusters. |
| clusplot | Draws a two-dimensional (2D) “clusplot” on the current
graphics device. |
| coef.hclust | Computes the “agglomerative coefficient,” measuring the
clustering structure of the data set. |
| daisy | Computes all the pairwise dissimilarities (distances)
between observations in the data set. |
| diana | Computes a divisive hierarchical clustering of the data
set, returning an object of class diana. |
| ellipsoidPoints | Computes points on the ellipsoid boundary, mostly for
drawing. |
| ellipsoidhull | Computes the “ellipsoid hull” or “spanning ellipsoid,”
i.e., the ellipsoid of minimal volume (“area” in 2D) such that
all given points lie just inside or on the boundary of the
ellipsoid. |
| fanny | Computes a fuzzy clustering of the data into
k
clusters. |
| lower.to.upper.tri.inds | Computes index vectors for extracting or reordering of
lower or upper triangular matrices that are stored as contiguous
vectors. |
| mona | Returns a list representing a divisive hierarchical
clustering of a data set with binary variables only. |
| pam | Partitioning (clustering) of the data into
k
clusters “around medoids,” a more robust version of
k-means clustering. |
| pltree | Generic function drawing a clustering tree (“dendrogram”) on the current graphics
device. There is a twins
method; see pltree.twins for
usage and examples. |
| predict.ellipsoid | Computes points on the ellipsoid boundary, mostly for
drawing. |
| silhouette | Computes silhouette information according to a given
clustering in k clusters. |
| sizeDiss | Returns the number of observations (sample
size) corresponding to a dissimilarity-like object
or, equivalently, the number of rows or columns of a matrix when
only the lower or upper triangular part (without diagonal) is
given. It is nothing else but the inverse function of f(n)
= n(n −
1)/2. |
| sortSilhouette | Computes silhouette information according to a given
clustering in k clusters. |
| upper.to.lower.tri.inds | Computes index vectors for extracting or reordering of
lower or upper triangular matrices that are stored as contiguous
vectors. |
| volume | Computes the volume of a planar object. This is a generic
function and a method for ellipsoid objects. |