Sciweavers

734 search results - page 3 / 147
» A New Indexing Method for High Dimensional Dataset
Sort
View
CVPR
1997
IEEE
14 years 9 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 7 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
PODS
2001
ACM
190views Database» more  PODS 2001»
14 years 7 months ago
On the Effects of Dimensionality Reduction on High Dimensional Similarity Search
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...
Charu C. Aggarwal
ADC
2003
Springer
123views Database» more  ADC 2003»
14 years 17 days ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
ICDE
2002
IEEE
91views Database» more  ICDE 2002»
14 years 9 days ago
Lossy Reduction for Very High Dimensional Data
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
Chris Jermaine, Edward Omiecinski