Fast exact \(k\) nearest neighbors search using an orthogonal search tree

DOI10.1016/J.PATCOG.2010.01.003zbMath1192.68587DBLPjournals/pr/LiawLW10OpenAlexW2132824401WikidataQ35664452 ScholiaQ35664452MaRDI QIDQ962830

Yi-Ching Liaw, Chien-Min Wu, Maw-Lin Leou

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.2010.01.003

zbMATH Keywords

orthonormal basisfast algorithm\(k\) nearest neighborsprincipal axis search tree

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (2)

An MPCA/LDA based dimensionality reduction algorithm for face recognition ⋮ Index-based, high-dimensional, cosine threshold querying with optimality guarantees

Cites Work

• Unnamed Item
• Unnamed Item
• Refinements to nearest-neighbor searching in k-dimensional trees
• Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
• Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
• Improvement of the fast exact pairwise-nearest-neighbor algorithm
• Principal component analysis.
• A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Nearest neighbor pattern classification
• Image restoration of compressed image using classified vector quantization

This page was built for publication: Fast exact \(k\) nearest neighbors search using an orthogonal search tree