Navigating K-Nearest Neighbor Graphs to Solve Nearest Neighbor Searches

By Edgar Chávez, Eric Sadit Tellez. 2010

15 citations recorded by the source corpus.

Subfields: Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition, Information Retrieval & Search, Algorithms & Complexity, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Graphics and Computer-Aided Design

1. Alexander Ponomarenko
2. Yury Malkov
3. Vladimir V. Krylov
4. Andrey Logvinov
5. Dmitry A. Yashunin

In Computer Vision and Pattern Recognition

1. Alexander Ponomarenko
2. Yury Malkov
3. Vladimir V. Krylov
4. Andrey Logvinov
5. Bilegsaikhan Naidan
6. Leonid Boytsov
7. Dmitry A. Yashunin
8. Augustus Odena

In Information Retrieval & Search

1. Alexander Ponomarenko
2. Yury Malkov
3. Vladimir V. Krylov
4. Andrey Logvinov
5. Dmitry A. Yashunin
6. Leonid Boytsov
7. Bilegsaikhan Naidan
8. Yu A. Malkov

In Algorithms & Complexity

1. Vladimir V. Krylov
2. Andrey Logvinov
3. Alexander Ponomarenko
4. Yury Malkov

In Signal Processing

1. Alexander Ponomarenko
2. Yury Malkov
3. Vladimir V. Krylov
4. Andrey Logvinov
5. Dmitry A. Yashunin
6. Leonid Boytsov
7. Bilegsaikhan Naidan
8. Yu A. Malkov

Citations in the corpus

• Approximate nearest neighbor algorithm based on navigable small world graphs (2014, methodology): “The work by Chávez and Tellez [27] also uses determination of nearest neighbors in its construction algorithm, with the greedy algorithm used for searching.”