An Improved Algorithm Finding Nearest Neighbor Using Kd-trees

DOI10.1007/978-3-540-78773-0_34zbMath1136.68373OpenAlexW1558159560MaRDI QIDQ5458545

Rina Panigrahy

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_34

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Data structures (68P05)

Related Items

Automated flexion crease identification using internal image seams ⋮ Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point location in arrangements of hyperplanes
• Lower bounds for high dimensional nearest neighbor search and related problems
• Lower Bounds on Locality Sensitive Hashing
• Entropy based nearest neighbor search in high dimensions
• Efficient algorithms for substring near neighbor problem
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Approximate nearest neighbor algorithms for Frechet distance via product metrics
• Locality-sensitive hashing scheme based on p-stable distributions
• Nearest neighbor pattern classification
• An algorithm for information structuring and retrieval
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Cell-probe lower bounds for the partial match problem