Implements exact and approximate methods for nearest neighbor detection, in a framework that allows them to be easily switched within Bioconductor packages or workflows. Exact searches can be performed using the k-means for k-nearest neighbors algorithm or with vantage point trees. Approximate searches can be performed using the Annoy or HNSW libraries. Searching on either Euclidean or Manhattan distances is supported. Parallelization is achieved for all methods by using BiocParallel. Functions are also provided to search for all neighbors within a given distance.
Package details |
|
---|---|
Author | Aaron Lun [aut, cre, cph] |
Bioconductor views | Classification Clustering |
Maintainer | Aaron Lun <infinite.monkeys.with.keyboards@gmail.com> |
License | GPL-3 |
Version | 1.8.2 |
Package repository | View on Bioconductor |
Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.