No project description provided
Project description
toha_nearest_neighbor
Serial and parallel bindings to brute force methods for 2D nearest neighbor problems in python
Benchmarks
Some basic benchmarks have been carried out against sklearn.neighbors
to show the relative performance
of this library. These preliminary results show better performance and better scaling in every function.
However, keep in mind that sklearn
handles a generic n-dimensional space while this package
has been simplified to work with 2D data. Moreover, sklearn
also has an additional algorithm ball_tree
that
scales to higher dimensions (N > 15) much better than kd-trees.
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
toha_nearest_neighbor-0.2.0.tar.gz
(211.5 kB
view hashes)
Close
Hashes for toha_nearest_neighbor-0.2.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 2d73bc57ec2bbf226f33c3270f9eca284e9f316eaadc73776621b812f0e07e08 |
|
MD5 | 151a115ee229bef3e717a94005c286dd |
|
BLAKE2b-256 | 9043aa0b6605ec900ad86838b7a69291e8864d53812eb0fbb4d4b2875812085b |