PCA-based branch and bound search algorithms for computing K nearest neighbors

DOI10.1016/S0167-8655(02)00384-7zbMath1048.68030MaRDI QIDQ4419531

Xavier Rodet, Wim D'Haes, Dirk van Dyck

Publication date: 13 August 2003

Published in: Pattern Recognition Letters (Search for Journal in Brave)

zbMATH Keywords

principal component analysisnonparametric estimation\(k\) nearest neighborsbranch and bound search algorithm

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Nonparametric estimation (62G05) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (3)

Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) ⋮ A practical approach to the 2D incremental nearest-point problem suitable for different point distributions ⋮ Some approaches to improve tree-based nearest neighbour search algorithms

This page was built for publication: PCA-based branch and bound search algorithms for computing K nearest neighbors