hopach (2.9.1)

Hierarchical Ordered Partitioning and Collapsing Hybrid (HOPACH).

http://www.stat.berkeley.edu/~laan/
http://docpollard.com/
http://cran.r-project.org/web/packages/hopach

The HOPACH clustering algorithm builds a hierarchical tree of clusters by recursively partitioning a data set, while ordering and possibly collapsing clusters at each level. The algorithm uses the Mean/Median Split Silhouette (MSS) criteria to identify the level of the tree with maximally homogeneous clusters. It also runs the tree down to produce a final ordered list of the elements. The non-parametric bootstrap allows one to estimate the probability that each element belongs to each cluster (fuzzy clustering).

Maintainer: Katherine S. Pollard
Author(s): Katherine S. Pollard, with Mark J. van der Laan <laan@stat.berkeley.edu> and Greg Wall

License: GPL (>= 2)

Uses: cluster, cluster
Reverse depends: SensoMineR
Reverse suggests: Rcell

Released almost 10 years ago.