Reducing non-determinism of k-NN searching in non-ordered discrete data spaces

DOI10.1016/J.IPL.2010.03.013zbMATH Open1229.68032OpenAlexW2013955559MaRDI QIDQ656596FDOQ656596

Authors: Dashiell Kolbe, Qiang Zhu, Sakti Pramanik 

Publication date: 18 January 2012

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

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

Recommendations

• Nearest neighbor queries in metric spaces
• scientific article; zbMATH DE number 437556
• Probably correct \(k\)-nearest neighbor search in high dimensions
• scientific article; zbMATH DE number 1559576
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces

zbMATH Keywords

databasesinformation retrieval\(k\)-nearest neighbor searchnon-ordered discrete data space

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Searching and sorting (68P10) Database theory (68P15)

Uses Software

• BLAT

This page was built for publication: Reducing non-determinism of \(k\)-NN searching in non-ordered discrete data spaces

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