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

Chávez, 2001, Searching in metric spaces, ACM Computing Surveys, 33, 273, 10.1145/502807.502808 Hjaltason, 2003, Index-driven similarity search in metric spaces, ACM Transactions on Database Systems, 28, 517, 10.1145/958942.958948 Kent, 2002, BLAT-the BLAST-like alignment tool, Genome Resources, 12, 656, 10.1101/gr.229202. Article published online before March 2002 D. Kolbe, Q. Zhu, S. Pramanik, On k-nearest neighbor searching in non-ordered discrete data spaces, in: International Conference on Data Engineering, 2007, pp. 426–435 Kolbe, 2010, Efficient k-nearest neighbor searching in non-ordered discrete data spaces, ACM Transactions on Information Systems, 28, 10.1145/1740592.1740595 G. Qian, Principles and applications for supporting similarity queries in non-ordered-discrete and continuous data spaces, PhD thesis, Michigan State University, East Lansing, 2004 Qian, 2006, Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach, ACM Transactions on Database Systems, 31, 439, 10.1145/1138394.1138395 R. Weber, H.-J. Schek, S. Blott, A Quantitative analysis and performance study for similarity-search methods in high-dimensional spaces, in: 24th International Conference on Very Large Data Bases, 1998, pp. 194–205