hopach.exlib File Reference

Detailed Description

Title:Hierarchical Ordered Partitioning and Collapsing Hybrid (HOPACH) Description: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).

Author:Katherine S. Pollard <kpollard@soe.ucsc.edu>, with Mark J. van der Laan <laan@stat.berkeley.edu>. Maintainer:Katherine S. Pollard <kpollard@soe.ucsc.edu> Version:1.4.0 Built:R 2.2.1; ; 2006-03-05 13:15:14; unix Depends:R (>= 1.8.0), cluster License:GPL version 2 or newer Packaged:Tue Nov 1 13:26:26 2005; kpollard URL:http://www.r-project.org, http://www.stat.berkeley.edu/~laan/, http://lowelab.ucsc.edu/katie/


namespace  hopach

Generated on Fri Apr 14 15:02:03 2006 for RGraphExampleLibrary by  doxygen 1.4.6