get_knn: Get k-nearest neighbor graph
In diem: Debris-Containing Droplet Identification using EM
Description
Usage
Arguments
Value
Description
Run a KNN graph and store as an igraph object. The nearest neighbors
are calculated using the dbscan implementation. The edges
of the graph can be weighted with the inverse of the
euclidean distance.
Usage
1
Arguments
x
An SCE object.
nn
Number of nearest neighbors to use.
weighted
Logical indicating whether to weigh the knn graph.
verbose
verbosity
Value
An SCE object
diem documentation built on Nov. 16, 2019, 1:08 a.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 Usage Arguments Value
Description
Run a KNN graph and store as an igraph object. The nearest neighbors are calculated using the dbscan implementation. The edges of the graph can be weighted with the inverse of the euclidean distance.
Usage
1 |
Arguments
x |
An SCE object. |
nn |
Number of nearest neighbors to use. |
weighted |
Logical indicating whether to weigh the knn graph. |
verbose |
verbosity |
Value
An SCE object
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.