The Cluster program provides several clustering algorithms. Hierarchical clustering methods organizes genes in a tree structure, based on their similarity. Four variants of hierarchical clustering are available in Cluster. In
*k*-means
clustering, genes are organized into
*k*
clusters, where the number of clusters
*k*
needs to be chosen in advance.
Self-Organizing Maps create clusters of genes on a two-dimensional rectangular grid, where neighboring clusters are similar. For each of these methods, one of the eight different distance meaures can be used. Finally, in Principal Component Analysis, clusters are organized based on the principal component axes of the distance matrix.

• Hierarchical: | Pairwise single-, maximum-, average-, and centroid-linkage hierarchical clustering | |

• KMeans: | k-means and k-medoids clustering
| |

• SOM: | Self-Organizing Maps | |

• PCA: | Principal Component Analysis |