# python3-pynndescent

## nearest neighbor descent for approximate nearest neighbors

Description

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.Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.

Upload a screenshot*Hint: upload an image here from your clipboard with Ctrl-V*

Homepage

https://github.com/lmcinnes/pynndescent/

Install this software package

If the package is available for the distribution you are currently using on your computer then install the software by clicking onâ€¦

Install python3-pynndescent