Nothing
bigANNOY: Approximate k-Nearest Neighbour Search for 'bigmemory' Matrices with Annoy
Approximate Euclidean k-nearest neighbour search routines that operate on 'bigmemory::big.matrix' data through Annoy indexes created with 'RcppAnnoy'. The package builds persistent on-disk indexes plus sidecar metadata from streamed 'big.matrix' rows, supports euclidean, angular, Manhattan, and dot-product Annoy metrics, and can either return in-memory results or stream neighbour indices and distances into destination 'bigmemory' matrices. Explicit index life cycle helpers, stronger metadata validation, descriptor-aware file-backed workflows, and benchmark helpers are also included.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Frederic Bertrand [aut, cre] |
| Maintainer | Frederic Bertrand <frederic.bertrand@lecnam.net> |
| License | GPL (>= 2) |
| Version | 0.3.0 |
| URL | https://fbertran.github.io/bigANNOY/ https://github.com/fbertran/bigANNOY |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the bigANNOY package in your browser
Any scripts or data that you put into this service are public.
