Optimal Partitioning of Similarity Relations
Classification Validity Assessment by Table Deviance
Identify Misclassified Plots in a Partition
Identification of Typal Samples in a Partition
Archipelago Analysis
Identify the Goodness-of-Fit of Cluster Members
Best Of Set Optimal Partitions From Random Starts
Classification Matching and Differencing
Maximal Clique Analysis
Clique Test
Clustering Object
Compare Species Constancy for Specified Clusters
(Fuzzy) Confusion Matrix
Recommendations for Possible Merging of Clusters
Dissimilarity Diameters of a Partition
Extract A Specific Cluster Solution From A Stride
Calculate a Flexible-Beta Dendrogram
Generalized Silhouette Width
Goodman- Kruskal Lambda Index of Classification Association
Maximally Similar Sets Analysis
Merge Specified Clusters in a Classification
Indicator Species Analysis by Murdoch Preference Function
Neighbor Analysis of Partitions
Optimum Classification by Counts of Indicator Species
Optimizing Classification by Maximizing Dufrene and Legendre's Indicat...
Internal Optpart Functions
Optimal Partitioning of Dissimilarity/Distance Matrices
Clustering by Optimizing Silhouette Widths
Optimizing Classification by Minimizing Table Deviance
Partition Analysis
Convert Object to Partition Object
Calculating the phi Statistic on Taxon Classifications
Refining a Classification by Re-Assigning Memberships
Re-order Clusters in a Classification
Produce a Silhouette Object From a Partana, Clustering, or Stride Obje...
Slice a Hierarchical Clustering Dendrogram with a Mouse
Stride: Producing a Sequence of Clusterings
Contains a set of algorithms for creating partitions and coverings of objects largely based on operations on (dis)similarity relations (or matrices). There are several iterative re-assignment algorithms optimizing different goodness-of-clustering criteria. In addition, there are covering algorithms 'clique' which derives maximal cliques, and 'maxpact' which creates a covering of maximally compact sets. Graphical analyses and conversion routines are also included.