Partially specified nearest neighbor searches using k-d trees |
| |
Authors: | C.M. Eastman M. Zemankova |
| |
Affiliation: | Department of Mathematics and Computer Science, Florida State University, Tallahassee, FL 32306, U.S.A. |
| |
Abstract: | A partially specified nearest neighbor query is a nearest neighbor search in which only some of the possible keys are specified. An algorithm that uses k-d trees to perform such searching is described. The expected time complexity is O(N1-). where k is the total number of keys and j the number of keys specified in the query. Experimental results, which are consistent with the theoretical predictions, are also presented. |
| |
Keywords: | Nearest neighbor search partially specified queries k-d trees |
本文献已被 ScienceDirect 等数据库收录! |