A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition

DOI10.1109/TPAMI.1986.4767859MaRDI QIDQ3758256zbMATH OpenOpenAlexWikidataFDO

Authors Baek S. Kim, Song B. Park

Publication date 1986

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tpami.1986.4767859

zbMATH Keywords

density estimationsearch treepreprocessingordered partitionnonparametric pattern recognitionk nearest neighbors

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited in

(11)

• WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION
• A complete system for NN classification based on a VLSI array processor
• Heuristic and optimization approaches to extending the Kohonen self organizing algorithm
• Some approaches to improve tree-based nearest neighbour search algorithms
• A Monte Carlo strategy for data-based mathematical modeling
• Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
• A novel encoding algorithm for vector quantization using transformed codebook
• A fast nearest neighbor search algorithm by filtration
• Exact \(k\)-NN queries on clustered SVD datasets
• Fast exact \(k\) nearest neighbors search using an orthogonal search tree
• Possibilistic instance-based learning

This page was built for publication: A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758256)