Accounting for boundary effects in nearest-neighbor searching
From MaRDI portal
Publication:1923772
DOI10.1007/BF02716805zbMath0853.68081MaRDI QIDQ1923772
Publication date: 2 January 1997
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Related Items
Classification using the Zipfian kernel ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Fast spectral analysis for approximate nearest neighbor search ⋮ A local search approximation algorithm for \(k\)-means clustering ⋮ Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Refinements to nearest-neighbor searching in k-dimensional trees
- Optimal Expected-Time Algorithms for Closest Point Problems
- Multidimensional binary search trees used for associative searching
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space