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)
Median (WPGMC)
Increase in Sum of Squares (Ward s method)
Sum of Squares
Flexible (ß space distortion parameter)
Density (or k-linkage, density-seeking mode analysis)
標簽：
ClustanGraphics
Complete
Neighbor
Linkage
上傳時間：
2014-01-02
上傳用戶：003030
