ClustanGraphics聚类分析工具。提供了11种聚类算法。 Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean Proximity Centroid (UPGMC)

一系列的图剖分算法，包括 - Complete-linkage algorithm - Single-linkage algorithm - Divisive min-diameter - Divisive sum-of-diameters - Agglomerative sum-of-diameters - K-Center algorithm

Robert Gordon University的一个研究人员写的k-means聚类算法工具箱，内容完整可运行。-Includes k-means, hierarchical (single-, complete- and mean-linkage), EM for Gaussian Mixture Models, fuzzy c-means, and a demo.