[Debian-med-packaging] Bug#980537: ITP: python-pynndescent -- nearest neighbor descent for approximate nearest neighbors

[Andreas Tille]

Package: wnpp
Severity: wishlist

Subject: ITP: python-pynndescent -- nearest neighbor descent for approximate nearest neighbors
Package: wnpp
Owner: Andreas Tille <tille at debian.org>
Severity: wishlist

* Package name    : python-pynndescent
  Version         : 0.5.1
  Upstream Author : "Leland McInnes <leland.mcinnes at gmail.com>
* URL             : https://pypi.org/project/pynndescent/
* License         : BSD-2-Clause
  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.

Remark: This package is maintained by Debian Med Packaging Team at
   https://salsa.debian.org/med-team/python-pynndescent