Description Usage Arguments Details Value Author(s) References See Also Examples
Reorder method for dendrograms for optimal leaf ordering.
1 2 
x 
an object of class 
dist 
an object of class 
method 
a character string with the name of the used measure
Available are:

... 
further arguments are currently ignored. 
Minimizes the distance between neighboring objects (leaf nodes) in the dendrogram by flipping the order of subtrees. The algorithm by Gruvaeus and Wainer is implemented in package gclus (Hurley 2004).
A reordered hclust
object.
Michael Hahsler
BarJoseph, Z., E. D. Demaine, D. K. Gifford, and T. Jaakkola. (2001): Fast Optimal Leaf Ordering for Hierarchical Clustering. Bioinformatics, 17(1), 22–29.
Gruvaeus, G. and Wainer, H. (1972): Two Additions to Hierarchical Cluster Analysis, British Journal of Mathematical and Statistical Psychology, 25, 200–206.
Hurley, Catherine B. (2004): Clustering Visualizations of Multidimensional Data. Journal of Computational and Graphical Statistics, 13(4), 788–806.
1 2 3 4 5 6 7 8 9 
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.