| dc.creator | Chávez, Edgar | |
| dc.creator | Ludueña, Verónica | |
| dc.creator | Reyes, Nora Susana | |
| dc.date | 2019-10 | |
| dc.date | 2019 | |
| dc.date | 2020-03-10T12:22:55Z | |
| dc.date.accessioned | 2023-07-14T18:42:46Z | |
| dc.date.available | 2023-07-14T18:42:46Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/90536 | |
| dc.identifier | isbn:978-987-688-377-1 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/7432486 | |
| dc.description | Among the similarity queries in metric spaces, there are one that obtains the k-nearest neighbors of all the elements in the database (All-k-NN). One way to solve it is the naïve one: comparing each object in the database with all the other ones and returning the k elements nearest to it (k-NN). Another way to do this is by preprocessing the database to build an index, and then searching on this index for the k-NN of each element of the dataset. Answering to the All-k-NN problem allows to build the k-Nearest Neighbor graph (kNNG). Given an object collection of a metric space, the Nearest Neighbor Graph (NNG) associates each node with its closest neighbor under the given metric. If we link each object to their k nearest neighbors, we obtain the k Nearest Neighbor Graph (kNNG).The kNNG can be considered an index for a database, which is quite efficient and can allow improvements.
In this work, we propose a new technique to solve the All-k-NN problem which do not use any index to obtain the k-NN of each element. This approach solves the problem avoiding as many comparisons as possible, only comparing some database elements and taking advantage of the distance function properties. Its total cost is significantly lower than that of the naïve solution. | |
| dc.description | XVI Workshop Bases de Datos y Minería de Datos. | |
| dc.description | Red de Universidades con Carreras en Informática | |
| dc.format | application/pdf | |
| dc.format | 567-576 | |
| dc.language | en | |
| dc.rights | http://creativecommons.org/licenses/by-nc-sa/4.0/ | |
| dc.rights | Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) | |
| dc.subject | Ciencias Informáticas | |
| dc.subject | All-k-NN problem | |
| dc.subject | Database | |
| dc.subject | k Nearest Neighbor Graph | |
| dc.title | Solving All-k-Nearest Neighbor Problem without an Index | |
| dc.type | Objeto de conferencia | |
| dc.type | Objeto de conferencia | |
