Improvement of the fast exact pairwise-nearest-neighbor algorithm

DOI10.1016/J.PATCOG.2008.10.001MaRDI QIDQ1010096zbMATH OpenOpenAlexFDO

Authors Yi-Ching Liaw

Publication date 3 April 2009

Published in Pattern Recognition (Search for Journal in Brave)

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

zbMATH Keywords

data clusteringfast search algorithmpairwise-nearest-neighbor

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Recommendations

• Fast agglomerative clustering using information of \(k\)-nearest neighbors
• scientific article; zbMATH DE number 1833430
• Fast exact \(k\) nearest neighbors search using an orthogonal search tree
• Improved \(k\)-nearest neighbor classification
• Fast \(k\)-nearest-neighbor search based on projection and triangular inequality

Cites work

• Image restoration of compressed image using classified vector quantization

Cited in

(5)

• Faster neighbour list generation using a novel lattice vector representation
• scientific article; zbMATH DE number 1833430 (Why is no real title available?)
• Fast agglomerative clustering using information of \(k\)-nearest neighbors
• Fast exact \(k\) nearest neighbors search using an orthogonal search tree
• Fast spatial decomposition and closest pair computation for limited precision input

This page was built for publication: Improvement of the fast exact pairwise-nearest-neighbor algorithm

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