Approximate Nearest Neighbor Graph via Index Construction
Given a collection of objects in a metric space, the Nearest Neighbor Graph (NNG) associate each node with its closest neighbor under the given metric. It can be obtained trivially by computing the nearest neighbor of every object. To avoid computing every distance pair an index could be construct...
Guardado en:
Autores principales: | Chávez, Edgar, Ludueña, Verónica, Reyes, Nora Susana, Kasián, Fernando |
---|---|
Formato: | Objeto de conferencia |
Lenguaje: | Inglés |
Publicado: |
2016
|
Materias: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/56767 |
Aporte de: |
Ejemplares similares
Ejemplares similares
-
An efficient alternative for deletions in dynamic spatial approximation trees
por: Kasián, Fernando, et al.
Publicado: (2014) -
New deletion method for dynamic spatial approximation trees
por: Kasián, Fernando, et al.
Publicado: (2013) -
Distal Dynamic Spatial Approximation Forest
por: Chávez, Edgar, et al.
Publicado: (2016) -
An Efficient Dynamic Version of the Distal Spatial Approximation Trees
por: Chávez, Edgar, et al.
Publicado: (2022) -
Decomposability of DiSAT for Index Dynamization
por: Chávez, Edgar, et al.
Publicado: (2017)