Probably correct \(k\)-nearest neighbor search in high dimensions

DOI10.1016/j.patcog.2009.09.026zbMath1192.68613OpenAlexW2024871046MaRDI QIDQ962679

Hideyuki Imai, Mineichi Kudo, Jun Toyama

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

zbMATH Keywords

pattern recognitionPAC frameworkprobably correct algorithmthe \(k\)-nearest neighbor method

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Uses Software

• MNIST

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Optimal Expected-Time Algorithms for Closest Point Problems
• Multidimensional binary search trees used for associative searching
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• An Algorithm for Finding Nearest Neighbors
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Nearest neighbor pattern classification

This page was built for publication: Probably correct \(k\)-nearest neighbor search in high dimensions