Probably correct \(k\)-nearest neighbor search in high dimensions
type: Item
instance of: scholarly article
title: Probably correct \(k\)-nearest neighbor search in high dimensions
zbMATH Open document ID: 1192.68613
author: Jun Toyama
author: Mineichi Kudo
author: Hideyuki Imai
published in: Pattern Recognition
publication date: 2010-04-07T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5690025
zbMATH Keywords: pattern recognition
zbMATH Keywords: the \(k\)-nearest neighbor method
zbMATH Keywords: probably correct algorithm
zbMATH Keywords: PAC framework
describes a project that uses: MNIST
MaRDI profile type: Publication
full work available at URL: j.patcog.2009.09.026
OpenAlex ID: W2024871046
cites work: Nearest neighbor pattern classification
cites work: A Branch and Bound Algorithm for Computing k-Nearest Neighbors
cites work: An Algorithm for Finding Nearest Neighbors
cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time
cites work: Multidimensional binary search trees used for associative searching
cites work: Optimal Expected-Time Algorithms for Closest Point Problems
cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions
cites work: Q4527027
cites work: Q4801190
cites work: Q4542583
cites work: Q3998716
cites work: Q4395494
DOI: 10.1016/J.PATCOG.2009.09.026
description: scientific article; zbMATH DE number 5690025