164 search results - page 6 / 33 » On k-Anonymity and the Curse of Dimensionality |
ICDE
2007
IEEE
15 years 3 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...
SISAP
2008
IEEE
15 years 3 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...
ISM
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
104
Voted
DEXAW
1999
IEEE
1999
IEEE
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
15 years 1 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...
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Microarrays allow simultaneous measurement of the expression levels of thousands of genes in cells under different physiological or disease states. Because the number of...