petabi / petal-neighborsLinks
Nearest neighbor search algorithms including a ball tree and a vantage point tree.
☆11Updated 2 weeks ago
Alternatives and similar repositories for petal-neighbors
Users that are interested in petal-neighbors are comparing it to the libraries listed below
Sorting:
- A ball-tree implementation for K-NN☆17Updated 10 months ago
- Parallel Barnes-Hut t-SNE implementation written in Rust.☆88Updated 3 weeks ago
- Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)☆21Updated 4 months ago
- Succinct data structures using very efficient rank and select☆125Updated last month
- Rust wrappers for NGT approximate nearest neighbor search☆38Updated last year
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆108Updated 2 years ago
- Locality Sensitive Hashing in Rust with Python bindings☆116Updated 2 years ago
- Rust implementation of the HNSW algorithm (Malkov-Yashunin)☆205Updated last month
- Rust implementations of succinct data structures☆59Updated last week
- Parallel iterator processing library for Rust☆103Updated last year
- A Rust interface for the Succinct Data Structure Library.☆14Updated 3 years ago
- A Rust port of the WebGraph framework☆55Updated last week
- A vec-backed tree structure with tree-specific generational indexes.☆40Updated last year
- HyperTwoBits implementation☆13Updated 8 months ago
- Integer sets as fast, sorted, integer ranges with full set operations☆89Updated this week
- Fast hierarchical agglomerative clustering in Rust.☆102Updated 4 months ago
- Parallelo Parallel Library (PPL) is a small parallel framework that brings Structured Parallel Programming in Rust.☆77Updated last month
- Lightning fast concurrent HyperLogLog for Rust.☆39Updated last week
- Rust libraries and programs focused on succinct data structures☆144Updated last week
- A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…☆99Updated 2 weeks ago
- An ε-copy serialization/deserialization framework for Rust☆152Updated last week
- A cross-platform and safe Rust API to create and manage memory mappings in the virtual address space of the calling process.☆67Updated 3 months ago
- Statistics, Information Measures, Linear Algebra, Cholesky Matrix Decomposition, Mahalanobis Distance, Householder QR Decomposition, Clif…☆54Updated last year
- VF2 subgraph isomorphism algorithm in Rust.☆65Updated 5 months ago
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated last week
- Automatically generates conversions between an enum type and any other type☆11Updated 2 years ago
- Small and fast library for k-means clustering.☆50Updated last month
- ☆23Updated last week
- Provides an interface layer to convert between n-dimensional types in different Rust crates☆56Updated 11 months ago
- An ergonomic graph API for Rust☆52Updated last week