All Near Neighbor Graph Without Searching

• Edgar Chávez ^[1] ; Verónica Ludueña ^[2] ; Nora Reyes ^[2] ; Fernando Kasián ^[2]
  1. [1] Center for Scientific Research and Higher Education at Ensenada

     Center for Scientific Research and Higher Education at Ensenada

     México

     
  2. [2] Universidad Nacional de San Luis

     Universidad Nacional de San Luis

     Argentina

     
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 18, Nº. 1, 2018, págs. 61-67
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Given a collection ofnobjects equipped with a dis-tance functiond(·,·), the Nearest Neighbor Graph(NNG) consists in finding the nearest neighbor ofeach object in the collection. Without an index thetotal cost of NNG is quadratic. Using an index thecost would be sub-quadratic if the search for indi-vidual items is sublinear. Unfortunately, due to theso calledcurse of dimensionalitythe indexed and thebrute force methods are almost equally inefficient. Inthis paper we present an efficient algorithm to buildthe Near Neighbor Graph (nNG), that is an approx-imation of NNG, using only the index construction,without actually searching for objects.