Seminar on Algorithms and Geometry 2014B – Problem Set 1 Robert Krauthgamer April 6, 2014 We discussed in class an algorithm for (1 + ε)-approximate Nearest Neighbor Search, by relying on the doubling dimension of the

Source URL: www.wisdom.weizmann.ac.il

Comparing Nearest Neighbor Algorithms in High-Dimensional Space Hendra Gunadi College of Engineering and Computer Science Australian National University

Source URL: users.cecs.anu.edu.au

• Mathematics
• Nearest neighbor search
• K-nearest neighbor algorithm
• Locality-sensitive hashing
• Ε-approximate nearest neighbor search
• Nearest-neighbor chain algorithm
• Information science
• Search algorithms
• Artificial intelligence

Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions by Alexandr Andoni and Piotr Indyk

Source URL: people.csail.mit.edu

• Information retrieval
• Locality-sensitive hashing
• Nearest neighbor search
• Hash function
• K-nearest neighbor algorithm
• Hash table
• K-d tree
• Voronoi diagram
• Ε-approximate nearest neighbor search
• Search algorithms
• Information science
• Artificial intelligence