103 search results - page 4 / 21 » Comparing Massive High-Dimensional Data Sets |
JMLR
2006
13 years 7 months ago
2006
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
13 years 11 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
ICDE
1998
IEEE
14 years 8 months ago
1998
IEEE
Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing r...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
ICDE
1998
IEEE
14 years 8 months ago
1998
IEEE
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...