All Projects → wildart → FLANN.jl

wildart / FLANN.jl

Licence: other
A Julia wrapper for Fast Library for Approximate Nearest Neighbors (FLANN)

Programming Languages

julia
2034 projects

Projects that are alternatives of or similar to FLANN.jl

machine learning
A gentle introduction to machine learning: data handling, linear regression, naive bayes, clustering
Stars: ✭ 22 (+57.14%)
Mutual labels:  nearest-neighbors
pupyl
🧿 Pupyl is a really fast image search library which you can index your own (millions of) images and find similar images in milliseconds.
Stars: ✭ 83 (+492.86%)
Mutual labels:  approximate-nearest-neighbors
rust-octree
rust implementation of octree algorithm for nearest neighbor search in 3D space
Stars: ✭ 29 (+107.14%)
Mutual labels:  nearest-neighbors
pynanoflann
Unofficial python wrapper to the nanoflann k-d tree
Stars: ✭ 24 (+71.43%)
Mutual labels:  nearest-neighbors
R-stats-machine-learning
Misc Statistics and Machine Learning codes in R
Stars: ✭ 33 (+135.71%)
Mutual labels:  nearest-neighbors
faiss-ruby
Efficient similarity search and clustering for Ruby
Stars: ✭ 62 (+342.86%)
Mutual labels:  approximate-nearest-neighbors
Ann Benchmarks
Benchmarks of approximate nearest neighbor libraries in Python
Stars: ✭ 2,658 (+18885.71%)
Mutual labels:  nearest-neighbors
adventures-with-ann
All the code for a series of Medium articles on Approximate Nearest Neighbors
Stars: ✭ 40 (+185.71%)
Mutual labels:  nearest-neighbors
graphgrove
A framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and nearest neighbor search
Stars: ✭ 29 (+107.14%)
Mutual labels:  nearest-neighbors
dbMAP
A fast, accurate, and modularized dimensionality reduction approach based on diffusion harmonics and graph layouts. Escalates to millions of samples on a personal laptop. Adds high-dimensional big data intrinsic structure to your clustering and data visualization workflow.
Stars: ✭ 39 (+178.57%)
Mutual labels:  nearest-neighbors
RANN
R package providing fast nearest neighbour search (wraps ANN library)
Stars: ✭ 43 (+207.14%)
Mutual labels:  nearest-neighbors
NearestNeighborDescent.jl
Efficient approximate k-nearest neighbors graph construction and search in Julia
Stars: ✭ 34 (+142.86%)
Mutual labels:  nearest-neighbors
fastknn
Fast k-Nearest Neighbors Classifier for Large Datasets
Stars: ✭ 64 (+357.14%)
Mutual labels:  nearest-neighbors
TIFUKNN
kNN-based next-basket recommendation
Stars: ✭ 38 (+171.43%)
Mutual labels:  nearest-neighbors
skyline-query
Simple implementation of spatial skyline query algorithms
Stars: ✭ 17 (+21.43%)
Mutual labels:  nearest-neighbors
entity-embed
PyTorch library for transforming entities like companies, products, etc. into vectors to support scalable Record Linkage / Entity Resolution using Approximate Nearest Neighbors.
Stars: ✭ 96 (+585.71%)
Mutual labels:  approximate-nearest-neighbors

FLANN.jl

A simple wrapper for FLANN, Fast Library for Approximate Nearest Neighbors. It has an interface similar to the NearestNeighbors package API.

Installation

Prerequisites for building binary dependency: gcc, cmake, liblz4.

Use the package manager to install:

pkg> add FLANN

Usage Example

using Distances
using FLANN

X = readdlm(Pkg.dir("FLANN", "test", "iris.csv"), ',')
v = X[:, 84]
k = 3
r = 10.0

idxs, dsts = knn(X, v, k, FLANNParameters())

# or

t = flann(X, FLANNParameters(), Minkowski(3))
inds, dists = knn(t, v, k)

# or

idxs, dsts = inrange(t, v, r)

# Do not forget to close index!
close(t)

TODO

  • Documentation
Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].