MinimalKNN: minimal package to construct k-NN Graph
Project description
A Minimal k-Nearest Neighbor Graph Construction Library
Overview
This package will provide a function to construct an approximated k-Nearest Neighbor graph from a list of three dimensional points. The graph construction algorithm is based on NN-descent presented in Dong, Moses, & Li (2011)[^DML2011]. The Euclidean and Manhattan metrics are implemented in the current version, while only the Euclidean one is available in Python. The algorithm efficiently constructs an approximated k-Nearest Neighbor graph. This provides a portable C++11 header and a Python interface.
Dependencies
The library is written in C++11 and do not depends on any library outside of the STL
. The Python interface is depends on NumPy
, and functional test procedures depend on Matplotlib
. The library is developed on g++
version 5.4 installed in Linux Mint 18.1 (serena). The Python interface is developed on Python 3.7.1 and Numpy 1.18.1.
References
[^DML2011]: Wei Dong, Charikar Moses, & Kai Li, WWW'11: Proceedings of the 20th international conference on World wide web (2011), 577--586 (doi: 10.1145/1963405.1963487)
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distributions
Hashes for minimalKNN-0.6-py3.9-linux-x86_64.egg
Algorithm | Hash digest | |
---|---|---|
SHA256 | 40ba94ed92915ccea8b78194f8e58a76f474c44eaabd49a0b38599e088a311a4 |
|
MD5 | 6c74a1c52d1229a3b52f08b555555c2e |
|
BLAKE2b-256 | ce975d9718a4dd4ea7073d5e117b2ad24730428764a5acc6d86b1e2cb92be9cd |
Hashes for minimalKNN-0.6-cp39-cp39-manylinux1_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | dd600dcc08f5eed06ac4fcc040810c33bc3035f6eb157a990f399d00ce0146f9 |
|
MD5 | a306b56fb13a420beaf10cb69afc1e59 |
|
BLAKE2b-256 | 3f0269f66c26609f0cc85b32d6833c02ea9e80ef27baf77e4bf8a45c489973df |