phenoGraph: Find clusters by network modularity
In yishaishimoni/phenoClust: Find clusters by network modularity
Description
This package implements the PhenoGraph algorithm, which
first creates an adjacancy matrix according to k-nearest
neighbours, and then uses the Louvain algorithm to
identify "communities" by maximizing the modularity.
In general, the only function that needs to be run is
phenoClust. Other functions are available
as utilities.
yishaishimoni/phenoClust documentation built on May 4, 2019, 5:28 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description
This package implements the PhenoGraph algorithm, which first creates an adjacancy matrix according to k-nearest neighbours, and then uses the Louvain algorithm to identify "communities" by maximizing the modularity.
In general, the only function that needs to be run is
phenoClust. Other functions are available
as utilities.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.