Near neighbor searching with K nearest references
By Edgar Chávez, Mario Graff, Gonzalo Navarro, Eric Sadit Tellez. 2015
31 citations recorded by the source corpus.
Subfields: Artificial Intelligence, 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 Artificial Intelligence
- Bilegsaikhan Naidan
- Leonid Boytsov
- Eric Nyberg
- Eric Sadit Tellez
- Mario Graff
- Guillermo Ruiz
- Edgar Chávez
- Yury Malkov
In Computer Vision and Pattern Recognition
- Bilegsaikhan Naidan
- Leonid Boytsov
- Eric Sadit Tellez
- Eric Nyberg
- Mario Graff
- Guillermo Ruiz
- Edgar Chávez
- Yury Malkov
In Information Retrieval & Search
- Bilegsaikhan Naidan
- Leonid Boytsov
- Eric Nyberg
- Eric Sadit Tellez
- Mario Graff
- Guillermo Ruiz
- Edgar Chávez
- Alexander Ponomarenko
In Algorithms & Complexity
- Bilegsaikhan Naidan
- Leonid Boytsov
- Eric Nyberg
- Mario Graff
- Edgar Chávez
- Eric Sadit Tellez
- Guillermo Ruiz
- Alexander Ponomarenko
In Signal Processing
- Bilegsaikhan Naidan
- Leonid Boytsov
- Eric Sadit Tellez
- Eric Nyberg
- Mario Graff
- Guillermo Ruiz
- Edgar Chávez
- Yury Malkov
Citations in the corpus
- Singleton indexes for nearest neighbor search (2016, unknown): “Examples of approximate techniques are [27, 7, 13, 1, 16, 15].”
- Finding Near Neighbors Through Local Search (2015, methodology): “This structural similarity was systematically explored in [6] adding several indexes to the list, like the KNR-Cos that uses the cosine similarity.”
- Permutation Search Methods are Efficient, Yet Faster Search is Possible (2015, methodology): “Our implementation is different from the proposition of Ch´avez et al. [25] and Tellez et al. [41] in at least two ways: (1) we do not compress the index and (2) we use a simpler algorithm, namely, the ScanCount, to merge posting lists [29].”