Probably correct k-nearest neighbor search in high dimensions
From MaRDI portal
Publication:962679
DOI10.1016/J.PATCOG.2009.09.026zbMATH Open1192.68613OpenAlexW2024871046MaRDI QIDQ962679FDOQ962679
Authors: Jun Toyama, Mineichi Kudo, Hideyuki Imai 
Publication date: 7 April 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2009.09.026
Recommendations
Cites Work
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Nearest neighbor pattern classification
- Title not available (Why is that?)
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- An Algorithm for Finding Nearest Neighbors
- Title not available (Why is that?)
- Optimal Expected-Time Algorithms for Closest Point Problems
- Multidimensional binary search trees used for associative searching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
Cited In (4)
- Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data
- Probabilistic proximity searching algorithms based on compact partitions
- Constructing a high-dimensional \(k\)NN-graph using a Z-order curve
- Reducing non-determinism of \(k\)-NN searching in non-ordered discrete data spaces
Uses Software
This page was built for publication: Probably correct \(k\)-nearest neighbor search in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962679)
