Bug#984796: ITP: pynndescent -- nearest neighbor descent for approximate nearest neighbors
Owner: Sebastien Delafond <email@example.com>
* Package name : pynndescent
Version : 0.5.2
Upstream Author : Leland McInnes <firstname.lastname@example.org>
* URL : https://github.com/lmcinnes/pynndescent
* License : BSD-2
Programming Lang: python
Description : nearest neighbor descent for approximate nearest neighbors
PyNNDescent is a Python nearest neighbor descent for approximate
nearest neighbors. It provides a Python implementation of Nearest
Neighbor Descent for k-neighbor-graph construction and approximate
nearest neighbor search, as per the paper:
Dong, Wei, Charikar Moses, and Kai Li. "Efficient k-nearest neighbor
graph construction for generic similarity measures." Proceedings of
the 20th international conference on World wide web. ACM, 2011.
This library supplements that approach with the use of random
projection trees for initialisation. This can be particularly useful
for the metrics that are amenable to such approaches (euclidean,
minkowski, angular, cosine, etc.). Graph diversification is also
performed, pruning the longest edges of any triangles in the graph.
Currently this library targets relatively high accuracy (80%-100%
accuracy rate) approximate nearest neighbor searches.