Título
Near neighbor searching with K nearest references
Autor
EDGAR LEONEL CHAVEZ GONZALEZ
Mario Graff
Gonzalo Navarro
ERIC SADIT TELLEZ AVILA
Nivel de Acceso
Acceso Abierto
Materias
Resumen o descripción
Proximity searching is the problem of retrieving,from agiven data base,those objects closest to aquery.To avoid exhaustive searching, data structures called indexes are builton the data base prior to serving queries.The curse of dimensionality is awell-known problem
for indexes: in spaces with sufficiently concentrated distance histograms,no index out performs anexhaustive scan of the data base.
Editor
Information Systems 51
Elsevier
Fecha de publicación
2015
Tipo de publicación
Artículo
Recurso de información
Formato
application/pdf
Idioma
Inglés
Audiencia
Investigadores
Repositorio Orígen
Repositorio Institucional de INFOTEC
Descargas
141