Crates.io | kn0sys-nn |
lib.rs | kn0sys-nn |
version | 0.8.2 |
source | src |
created_at | 2024-09-25 14:35:16.391952 |
updated_at | 2024-10-07 00:42:01.636271 |
description | A collection of nearest neighbour algorithms |
homepage | |
repository | https://github.com/kn0sys/linfa |
max_upload_size | |
id | 1386407 |
size | 49,871 |
linfa-nn
provides a pure Rust implementation of nearest neighbor algorithms.
linfa-nn
is a crate in the linfa
ecosystem, an effort to create a toolkit for classical Machine Learning implemented in pure Rust, akin to Python's scikit-learn
.
Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar) to a given point. Closeness is typically expressed in terms of a dissimilarity function: the less similar the objects, the larger the function values.
linfa-nn currently provides the following implementations: - linear - balltree - KDTree
Dual-licensed to be compatible with the Rust project.
Licensed under the Apache License, Version 2.0 http://www.apache.org/licenses/LICENSE-2.0 or the MIT license http://opensource.org/licenses/MIT, at your option. This file may not be copied, modified, or distributed except according to those terms.