Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/ekzhu/lsh
Locality Sensitive Hashing for Go (Multi-probe LSH, LSH Forest, basic LSH)
https://github.com/ekzhu/lsh
lsh lsh-forest multi-probe-lsh
Last synced: 2 months ago
JSON representation
Locality Sensitive Hashing for Go (Multi-probe LSH, LSH Forest, basic LSH)
- Host: GitHub
- URL: https://github.com/ekzhu/lsh
- Owner: ekzhu
- License: mit
- Created: 2016-01-21T19:24:37.000Z (almost 9 years ago)
- Default Branch: master
- Last Pushed: 2018-07-21T06:23:18.000Z (over 6 years ago)
- Last Synced: 2024-10-14T07:33:41.327Z (3 months ago)
- Topics: lsh, lsh-forest, multi-probe-lsh
- Language: Go
- Homepage:
- Size: 79.1 KB
- Stars: 101
- Watchers: 6
- Forks: 15
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LSH for Go
[![Build Status](https://travis-ci.org/ekzhu/lsh.svg?branch=master)](https://travis-ci.org/ekzhu/lsh)
[![GoDoc](https://godoc.org/github.com/ekzhu/lsh?status.svg)](https://godoc.org/github.com/ekzhu/lsh)
[![DOI](https://zenodo.org/badge/50131034.svg)](https://zenodo.org/badge/latestdoi/50131034)[Documentation](https://godoc.org/github.com/ekzhu/lsh)
Install: `go get github.com/ekzhu/lsh`
This library includes various Locality Sensitive Hashing (LSH) algorithms
for the approximate nearest neighbour search problem in L2 metric space.
The family of LSH functions for L2 is the work of
[Mayur Datar et.al.](http://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p253-datar.pdf)Currently includes:
* [Basic LSH](http://www.vldb.org/conf/1999/P49.pdf)
* [Multi-probe LSH](http://www.cs.princeton.edu/cass/papers/mplsh_vldb07.pdf)
* [LSH Forest](http://infolab.stanford.edu/~bawa/Pub/similarity.pdf)