On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
Kolbe, D.; Qiang Zhu; Pramanik, S.
Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on
Volume , Issue , 15-20 April 2007 Page(s):426 - 435
Digital Object Identifier 10.1109/ICDE.2007.367888
Summary:A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the past for supporting efficient k-NN searches in continuous data spaces. No such work has been reported in the literature for k-NN searches in a non-ordered discrete data space (NDDS). Performing k-NN searches in an NDDS raises new challenges. The Hamming distance is usually used to measure the distance between two vectors (objects) in an NDDS. Due to the coarse granularity of the Hamming distance, a k-NN query in an NDDS may lead to a large set of candidate solutions, creating a high degree of non-determinism for the query result. We propose a new distance measure, called granularity-enhanced Hamming (GEH) distance, that effectively reduces the number of candidate solutions for a query. We have also considered using multidimensional database indexing for implementing k-NN searches in NDDSs. Our experiments on synthetic and genomic data sets demonstrate that our index-based k-NN algorithm is effective and efficient in finding k-NNs in NDDSs.
View citation and abstract |
Cart
