Fast \(k\)-nearest-neighbor search based on projection and triangular inequality

DOI10.1016/j.patcog.2006.04.024zbMath1118.68055OpenAlexW2015179148MaRDI QIDQ854187

Julie Liu, Yi-Ching Liaw, Jim Z. C. Lai

Publication date: 7 December 2006

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

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.04.024

zbMATH Keywords

intrinsic dimensionnearest neighborsfast search algorithmprojection value

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (5)

Fast agglomerative clustering using information of \(k\)-nearest neighbors ⋮ Faster retrieval with a two-pass dynamic-time-warping lower bound ⋮ Fast global \(k\)-means clustering using cluster membership and inequality ⋮ Fast exact \(k\) nearest neighbors search using an orthogonal search tree ⋮ A novel encoding algorithm for vector quantization using transformed codebook

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
• Multidimensional Binary Search Trees in Database Applications
• Image restoration of compressed image using classified vector quantization

This page was built for publication: Fast \(k\)-nearest-neighbor search based on projection and triangular inequality