57 search results - page 2 / 12 » High-Dimensional Similarity Search Using Data-Sensitive Spac... |
DAWAK
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
105
click to vote
ICDE
2000
IEEE
15 years 5 days ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
VLDB
2000
ACM
14 years 2 months ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
ICDE
2007
IEEE
14 years 5 months ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
PODS
2001
ACM
14 years 11 months ago
2001
ACM
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...