khabbazian/sparseAHC: Agglomerative Hierarchical Clustering for Sparse Similarity Matrices.
Version 1.20

An implementation of the agglomerative hierarchical clustering method that accepts sparse similarity matrices. A similarity matrix can be interpreted as the adjacency matrix of a weighted undirected graph. In this graph, the edge weights represent the similarity of the two endpoints. Furthermore, absence of an edge is weak signal of similarity. This implementation builds the output dendrograms without expanding the matrix into the memory. The memory complexity is linear in terms of the number of non-zero entries in the input.

Getting started

Package details

AuthorMohammad Khabbazian
MaintainerMohammad Khabbazian <[email protected]>
LicenseGPL (>= 3)
Version1.20
URL https://github.com/khabbazian/
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
install.packages("devtools")
library(devtools)
install_github("khabbazian/sparseAHC")
khabbazian/sparseAHC documentation built on May 18, 2017, 7:41 p.m.