LSH vs Randomized Partition Trees: Which One to Use for Nearest Neighbor Search?
Kaushik SinhaPublished in: ICMLA (2014)
Keyphrases
- nearest neighbor search
- locality sensitive hashing
- kd trees
- approximate nearest neighbor
- kd tree
- nearest neighbor
- approximate nearest neighbor search
- nn search
- high dimensional
- similarity search
- feature space
- search methods
- image retrieval
- cost model
- exhaustive search
- decision trees
- metric space
- index structure
- distance computation
- hash table
- query processing
- query optimization
- tree structure
- databases
- database
- high dimensional data
- space partitioning
- similarity measure