Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...
Compile Dependencies (3)
| Category/License | Group / Artifact | Version | Updates | |
|---|---|---|---|---|
String Utils
MIT
| | info.debatty
»
java-string-similarity Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard ... | 0.8 | 2.0.0 |
MIT
| | info.debatty
»
java-lsh A Java implementation of Locality Sensitive Hashing (LSH) | 0.4 | 0.12 |
Hashing
MIT
| | info.debatty
»
java-spamsum A Java implementation of SpamSum / SSDeep / Context Triggered Piecewise Hashing | 0.1 | 0.2 |
