Skip to content

Latest commit

 

History

History
27 lines (21 loc) · 968 Bytes

README.md

File metadata and controls

27 lines (21 loc) · 968 Bytes

License: MIT

Nearest Neighbor Search



You can first build data vectors using the item class and then you can run a k-NN or radius local search using the model class.

Available Methods

  • Locality-sensitive hashing (LSH)
  • Hypercube search
  • Exhuastive search

Metrics: Euclidean and Cosine

Installation

Clone this repository to your local machine:

https://github.com/PetropoulakisPanagiotis/nearest-neighbor-search.git

Wiki

Author

Petropoulakis Panagiotis [email protected]