Locality Sensitive Hashing (LSH) Home Page

LSH Algorithm and Implementation (E2LSH) Locality-Sensitive Hashing (LSH) is an algorithm for solving the approximate or exact Near Neighbor Search in high dimensional spaces. This webpage links to the newest LSH algorithms in Euclidean and Hamming spaces, as well as the E2LSH package, an implementation of an early practical LSH algorithm. Check out also the 2015--2016 FALCONN package, which is a

[taki0313]

実装してみたい

[hiromark]

ちと深く追いかけたい。

[Nyoho]

類似度計算アルゴリズムと聞いて飛んできましたー

[tettsyun]

LSH

[solitary_shell]

近似最近傍探索

[tokada]

近傍ベクトルが同じハッシュ値になるようなハッシュ関数。近さはいろいろ変えられる。

[inak0shi]

3日で作る高速特定物体認識システム

[aidiary]

ユークリッド距離空間のLSH -> E2LSH