|
You are here |
www.cs.ubc.ca | ||
| | | | |
kevinkle.in
|
|
| | | | | Using Approximate Nearest Neighbors to stitch images to images | |
| | | | |
blog.vespa.ai
|
|
| | | | | From text search and recommendation to ads and online dating, ANN search rarely works in isolation. | |
| | | | |
erikbern.com
|
|
| | | | | Annoy is a library written by me that supports fast approximate nearest neighbor queries. Say you have a high (1-1000) dimensional space with points in it, and you want to find the nearest neighbors to some point. | |
| | | | |
erikbern.com
|
|
| | | Approximate nearest neighbor search is very useful when you have a large dataset of millions of datapoints and you learn some kind of vector representation of these items. I built a benchmark suite called ann-benchmarks. It pits a number of algorithms in a brutal showdown. | ||