Sciweavers

161 search results - page 1 / 33
» What Is the Nearest Neighbor in High Dimensional Spaces
Sort
View
VLDB
2000
ACM
166views Database» more  VLDB 2000»
13 years 8 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
ICDT
2001
ACM
116views Database» more  ICDT 2001»
13 years 9 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
PODS
1997
ACM
182views Database» more  PODS 1997»
13 years 8 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
13 years 8 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
JMLR
2010
119views more  JMLR 2010»
12 years 11 months ago
Hubs in Space: Popular Nearest Neighbors in High-Dimensional Data
Different aspects of the curse of dimensionality are known to present serious challenges to various machine-learning methods and tasks. This paper explores a new aspect of the dim...
Milos Radovanovic, Alexandros Nanopoulos, Mirjana ...