See this document in CiteSeerX!

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (1998)  (Make Corrections)  (46 citations)
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani



  Home/Search   Context   Related

 
View or download:
ucla.edu/~rafail/PUBLIC/36.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ucla.edu/~rafail/PUBLIC/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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 vectors in some high dimensional Euclidean space, we want to construct a space-efficient data structure that would allow us to search, given a query vector, for the closest or nearly closest vector in the database. We also address this problem when distances are measured by the L 1 norm, and in the Hamming cube.... (Update)

Cited by:   More
An Investigation of Practical Approximate Nearest Neighbor .. - Liu, Moore, Gray, Yang   (Correct)
Approximate Nearest Neighbors and Sequence Comparison - With Block Operations   (Correct)
Subquadratic Approximation Algorithms For Clustering Problems - In High Dimensional   (Correct)

Active bibliography (related documents):   More   All
1.0:   Efficient Search for Approximate Nearest Neighbor in.. - Kushilevitz.. (1998)   (Correct)
0.7:   Lower Bounds for High Dimensional Nearest Neighbor.. - Borodin, Ostrovsky.. (1999)   (Correct)
0.6:   Tighter Lower Bounds for Nearest Neighbor Search and Related.. - Barkol, Rabani (2000)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.4:   Polynomial Time Approximation Schemes for Geometric k-Clustering - Ostrovsky, Rabani (2000)   (Correct)
0.3:   One-way Trapdoor Permutations Are Sufficient for.. - Kushilevitz, Ostrovsky (2000)   (Correct)
0.3:   Low Distortion Embeddings for Edit Distance - Ostrovsky, Rabani (2005)   (Correct)

Related documents from co-citation:   More   All
38:   Approximate nearest neighbors: Towards removing the curse of dimensionality - Indyk, Motwani - 1998
24:   Two algorithms for nearest-neighbor search in high dimensions - Kleinberg
16:   An optimal algorithm for approximate nearest neighbor searching - Arya, Mount et al. - 1994

BibTeX entry:   (Update)

E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In Proc. of 30th STOC, pp. 614--623, 1998. http://citeseer.ist.psu.edu/kushilevitz98efficient.html   More

@inproceedings{ kushilevitz98efficient,
    author = "Eyal Kushilevitz and Rafail Ostrovsky and Yuval Rabani",
    title = "Efficient search for approximate nearest neighbor in high dimensional spaces",
    pages = "614--623",
    year = "1998",
    url = "citeseer.ist.psu.edu/kushilevitz98efficient.html" }
Citations (may not include all citations):
2133   Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
957   The Probabilistic Method (context) - Alon, Spencer - 1992
643   Query by image and video content: the QBIC system (context) - Flickner, Sawhney et al. - 1995
568   Indexing by latent semantic analysis - Deerwester, Dumais et al. - 1990
454   the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Chervonenkis - 1971
345   Vector Quantization and Signal Compression (context) - Gersho, Gray - 1991
318   Automatic Text Processing (context) - Salton - 1989
286   Nearest neighbor pattern classification (context) - Cover, Hart - 1967
266   An optimal algorithm for approximate nearest neighbor search.. - Arya, Mount et al. - 1994
243   Photobook: tools for content-based manipulation of image dat.. (context) - Pentland, Picard et al. - 1994
197   Cambridge University Press (context) - Kushilevitz, Nisan - 1997
186   Computational Geometry: An Introduction Through Randomized A.. (context) - Mulmuley - 1993
171   A weighted nearest neighbor algorithm for learning with symb.. - Cost, Salzberg - 1993
170   The geometry of graphs and some of its algorithmic applicati.. - Linial, London et al. - 1995
165   Approximate nearest neighbors: Towards removing the curse of.. - Indyk, Motwani
149   A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
118   Ray shooting and parametric search (context) - Agarwal, Matousek - 1992
96   Discriminant adaptive nearest neighbor classification - Hastie, Tibshirani - 1995
91   Two algorithms for nearest-neighbor search in high dimension.. - Kleinberg - 1997
79   Extensions of Lipschitz mappings into Hilbert space (context) - Johnson, Lindenstrauss - 1984
64   A randomized algorithm for closest-point queries (context) - Clarkson - 1988
58   Reporting points in halfspaces (context) - Matousek - 1991
45   An algorithm for approximate closest-point queries (context) - Clarkson - 1994
28   Locality-preserving hashing in multidimensional spaces - Indyk, Motwani et al. - 1997
27   Point location in arrangements of hyperplanes (context) - Meiser - 1993
24   Shape indexing using approximate nearest-neighbor search in .. - Beis, Lowe - 1997
22   Computing with unreliable information (context) - Feige, Peleg et al. - 1990
18   Non-expansive hashing - Linial, Sasson - 1996
15   Multidimensional search problems (context) - Dobkin, Lipton - 1976
14   Neighborhood preserving hashing and approximate queries (context) - Dolev, Harari et al. - 1994
11   Finding the neighborhood of a query in a dictionary - Dolev, Harari et al. - 1993
10   Nearest neighbor methods in discrimination (context) - Devroye, Wagner - 1982
7   A general approach to d-dimension geometric queries (context) - Yao, Yao - 1985
6   st Workshop on Image Databases and MultiMedia Search (context) - Smeulders, Jain et al. - 1996



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.ucla.edu/~rafail/PUBLIC/index.html):   More
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004)   (Correct)
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004)   (Correct)
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC