A Branch and Bound Algorithm for Computing k-Nearest Neighbors

DOI10.1109/T-C.1975.224297zbMath0307.68069WikidataQ56271120 ScholiaQ56271120MaRDI QIDQ4065065

Patrenahalli M. Narendra, Keinosuke Fukunaga

Publication date: 1975

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Related Items (33)

Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set ⋮ Fast and versatile algorithm for nearest neighbor search based on a lower bound tree ⋮ Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) ⋮ Self-generating prototypes for pattern classification ⋮ Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy ⋮ Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem ⋮ Model-free data-driven inference in computational mechanics ⋮ Model-free and prior-free data-driven inference in mechanics ⋮ An optimal-transport finite-particle method for mass diffusion ⋮ A VNS based framework for early diagnosis of the Alzheimer's disease converted from mild cognitive impairment ⋮ Distance-based index structures for fast similarity search ⋮ A fuzzy extended \(k\)-nearest neighbors rule ⋮ Efficient data structures for model-free data-driven computational mechanics ⋮ Image classification based on quantum K-nearest-neighbor algorithm ⋮ Probably correct \(k\)-nearest neighbor search in high dimensions ⋮ Fast exact \(k\) nearest neighbors search using an orthogonal search tree ⋮ WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION ⋮ Index structures for fast similarity search for real vectors. II ⋮ Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition ⋮ A fast nearest neighbor search algorithm by filtration ⋮ Performance of feature-selection methods in the classification of high-dimension data ⋮ Dual‐tree fast exact max‐kernel search ⋮ Vertex nomination via seeded graph matching ⋮ Heuristic and optimization approaches to extending the Kohonen self organizing algorithm ⋮ GRAFT, a complete system for data fusion ⋮ Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions ⋮ A novel texture clustering method based on shift invariant DWT and locality preserving projection ⋮ Some approaches to improve tree-based nearest neighbour search algorithms ⋮ Random clustering forest for extended belief rule-based system ⋮ Chromatic nearest neighbor searching: A query sensitive approach ⋮ Efficient prototype reordering in nearest neighbor classification ⋮ A complete system for NN classification based on a VLSI array processor ⋮ Thinking Ultrametrically, Thinking p-Adically

This page was built for publication: A Branch and Bound Algorithm for Computing k-Nearest Neighbors