Sunil Arya, David M. Mount, Onuttom Narayan  Home/Search
Context Related
| umd.edu/users/mount/Pape...boundary.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: umd.edu/users/mount/pubs (more) Homepages: D.Mount |
Rate this article:      (best)Comment on this article |
Abstract: Given n data points in d-dimensional space, nearest neighbor searching involves determining the nearest of these data points to a given query point. Most averagecase analyses of nearest neighbor searching algorithms are made under the simplifying assumption that d is fixed and that n is so large relative to d that boundary effects can be ignored. This means that for any query point the statistical distribution of the data points surrounding it is independent of the location of the query point.... (Update)
Context of citations to this paper: More
...neighbor queries have been reported in the literature. Among those are nearest neighbor search algorithms based on Voronoi cells [2, 5] and branch and bound techniques [26, 27] a nearest neighbor search algorithm for ranking requirement [15] and multi step # nearest...
...in dimension, but these experiments indicate a more modest growth. This is likely due to boundary effects. This phenomenon was described in [4] in the context of nearest neighbor searching. The hybrid heuristic and iterated Lloyd s performed comparably with respect to average...
Cited by: More
Optimizing Search Strategies in k-d Trees - Sample, Haines, Arnold, Purcell (2001) (Correct)
Limitations of Non-Uniform Computational Models - Chakrabarti (2002) (Correct)
Dynamically Optimizing High-Dimensional Index Structures - Böhm, Kriegel (2000) (Correct)
Similar documents (at the sentence level):
57.2%: Accounting for Boundary Effects in Nearest Neighbor Searching - Arya, Mount, Narayan (1995) (Correct)
Active bibliography (related documents): More All
0.2: Chromatic Nearest Neighbor Searching: A Query Sensitive.. - Mount, Netanyahu.. (2000) (Correct)
0.1: An Optimal Algorithm for Approximate Nearest.. - Arya, Mount.. (1994) (Correct)
0.1: Geometric Range Searching and Its Relatives - Agarwal, Erickson (1999) (Correct)
Similar documents based on text: More All
0.3: Approximate Range Searching - Arya, Mount (1995) (Correct)
0.3: ANN Programming Manual - Mount (1998) (Correct)
0.3: Approximate Nearest Neighbor Queries in Fixed Dimensions - Arya, Mount (1993) (Correct)
Related documents from co-citation: More All
12: An optimal algorithm for approximate nearest neighbor searching - Arya, Mount et al. - 1994
11: A cost model for nearest neighbor search in high-dimensional data space (context) - Berchtold, Bohm et al. - 1997
10: An algorithm for finding best matches in logarithmic expected time (context) - Friedman, Bentley et al. - 1977
BibTeX entry: (Update)
S. Arya, D. M. Mount, and O. Narayan. Accounting for boundary effects in nearest neighbor searching. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 336-- 344, 1995. http://citeseer.ist.psu.edu/arya96accounting.html More
@inproceedings{ arya95accounting,
author = "Sunil Arya and David M. Mount and Onuttom Narayan",
title = "Accounting for Boundary Effects in Nearest Neighbor Searching",
booktitle = "Symposium on Computational Geometry",
pages = "336--344",
year = "1995",
url = "citeseer.ist.psu.edu/arya96accounting.html" }
Citations (may not include all citations):1749 An introduction to probability theory and its applications (context) - Feller - 1968
346 Multidimensional binary search trees used for associative se.. (context) - Bentley - 1975
345 Vector Quantization and Signal Compression (context) - Gersho, Gray - 1991
266 An optimal algorithm for approximate nearest neighbor search.. - Arya, Mount et al. - 1994
247 An algorithm for finding best matches in logarithmic expecte.. (context) - Friedman, Bentley et al. - 1977
74 Mathematical methods for physicists (context) - Arfken - 1985
69 Optimal expected-time algorithms for closest point problems (context) - Bentley, Weide et al. - 1980
52 Refinements to nearest-neighbor searching in k-dimensional t.. (context) - Sproull - 1991
45 An algorithm for approximate closest-point queries (context) - Clarkson - 1994
36 Algorithms for fast vector quantization - Arya, Mount - 1993
35 Approximate nearest neighbor queries in fixed dimensions - Arya, Mount - 1993
14 the optimality of Elias's algorithm for performing best-matc.. (context) - Rivest - 1974
13 Analysis of an algorithm for finding nearest neighbors in Eu.. (context) - Cleary - 1979
3 Some mathematical methods of physics (context) - Goertzel, Tralli - 1960
1 Bounds on the information retrieval e#ciency of static file .. (context) - Welch - 1971
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umd.edu/users/mount/pubs.html): More
Analysis of Approximate Nearest Neighbor Searching with.. - Maneewongvatana, Mount (1999) (Correct)
Efficient Randomized Algorithms for the Repeated Median .. - Matousek, Mount.. (1993) (Correct)
Query-Sensitive Ray Shooting - Mitchell, al. (1994) (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