15 search results - page 1 / 3 » Can Shared-Neighbor Distances Defeat the Curse of Dimensiona... |
SSDBM
2010
IEEE
13 years 10 months ago
2010
IEEE
ALENEX
2001
13 years 6 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
DEXAW
1999
IEEE
1999
IEEE
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
13 years 9 months ago
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
SISAP
2008
IEEE
13 years 11 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
ICASSP
2009
IEEE
13 years 12 months ago
2009
IEEE
Due to the curse of dimensionality, high-dimensional data is often pre-processed with some form of dimensionality reduction for the classification task. Many common methods of su...