Exact \(k\)-NN queries on clustered SVD datasets

DOI10.1016/J.IPL.2005.03.003zbMath1182.68077OpenAlexW1998984865MaRDI QIDQ1041760

Yue Li, Alexander Thomasian, Lijuan Zhang

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.03.003

zbMATH Keywords

algorithmsclusteringsingular value decompositionprincipal component analysisdimensionality reductiondatabasesmultidimensional indexing\(k\)-nearest-neighbor queries

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Principal component analysis.
• A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition

This page was built for publication: Exact \(k\)-NN queries on clustered SVD datasets