Accessing very high dimensional spaces in parallel
Ver/ Abrir
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7036
comunitat-uji-handle3:10234/8620
comunitat-uji-handle4:
INVESTIGACIONMetadatos
Título
Accessing very high dimensional spaces in parallelFecha de publicación
2016-02-17Editor
SpringerISSN
0920-8542; 1573-0484Cita bibliográfica
ARTIGAS-FUENTES, F. J.; BADÍA, J. M. Accessing very high dimensional spaces in parallel. The Journal of Supercomputing, 2016, p. 1-14Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://link.springer.com/article/10.1007%2Fs11227-016-1673-3Palabras clave / Materias
Resumen
Access methods are a fundamental tool on Information Retrieval. However,
most of these methods suffer the problem known as the curse of dimensionality when
they are applied to objects with very high dimensionality ... [+]
Access methods are a fundamental tool on Information Retrieval. However,
most of these methods suffer the problem known as the curse of dimensionality when
they are applied to objects with very high dimensionality representation spaces, such
as text documents. In this paper we introduce a new parallel access method that uses
several graphs as distributed index structure and a kNN search algorithm. Two parallel
versions of the search method are presented, one based on master–slave scheme and
the other based on a pipeline. A thorough experimental analysis on different datasets
shows that our method can process efficiently large flows of queries, compete with
other parallel algorithms and obtain at the same time very high quality results. [-]
Derechos de acceso
© Springer Science+Business Media
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
Aparece en las colecciones
- ICC_Articles [424]