linfa-nn
| Crates.io | linfa-nn |
| lib.rs | linfa-nn |
| version | |
| source | src |
| created_at | 2021-10-21 14:22:49.846235 |
| updated_at | 2025-01-14 15:40:40.568344 |
| description | A collection of nearest neighbour algorithms |
| homepage | |
| repository | https://github.com/rust-ml/linfa/ |
| max_upload_size | |
| id | 468474 |
| Cargo.toml error: | TOML parse error at line 18, column 1 | 18 | autolib = false | ^^^^^^^ unknown field `autolib`, expected one of `name`, `version`, `edition`, `authors`, `description`, `readme`, `license`, `repository`, `homepage`, `documentation`, `build`, `resolver`, `links`, `default-run`, `default_dash_run`, `rust-version`, `rust_dash_version`, `rust_version`, `license-file`, `license_dash_file`, `license_file`, `licenseFile`, `license_capital_file`, `forced-target`, `forced_dash_target`, `autobins`, `autotests`, `autoexamples`, `autobenches`, `publish`, `metadata`, `keywords`, `categories`, `exclude`, `include` |
| size | 0 |
wg (github:rust-ml:wg)
documentation
README
Nearest Neighbor
linfa-nn provides a pure Rust implementation of nearest neighbor algorithms.
The Big Picture
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.
Current State
linfa-nn currently provides the following implementations: - linear - balltree - KDTree
License
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.