Hierarchical clustering for sparsely linked datasets. Inputs are specified as a weighted connectivity matrix instead of a full distance matrix, which is much more memory efficient for cases where many points are totally unconnected.
|Author||Michael A. Stravs <[email protected]>|
|Maintainer||Michael A. Stravs <[email protected]>|
|License||GPL (>= 2)|
|Package repository||View on GitHub|
Install the latest version of this package by entering the following in R:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.