D. E. Willard, “New Data Structures for Orthogonal Range Queries,” SIAM Journal on Computing, Vol. 14, No. 1, 1985, pp. 232-253. doi:10.1137/0214019
has been cited by the following article:
TITLE: A Logarithmic-Complexity Algorithm for Nearest Neighbor Classification Using Layered Range Trees
AUTHORS: Ibrahim Al-Bluwi, Ashraf Elnagar
KEYWORDS: Nearest Neighbor Classifier; Range Trees; Logarithmic Order
JOURNAL NAME: Intelligent Information Management, Vol.4 No.2, March 28, 2012
ABSTRACT: Finding Nearest Neighbors efficiently is crucial to the design of any nearest neighbor classifier. This paper shows how Layered Range Trees (LRT) could be utilized for efficient nearest neighbor classification. The presented algorithm is robust and finds the nearest neighbor in a logarithmic order. The proposed algorithm reports the nearest neighbor in , where k is a very small constant when compared with the dataset size n and d is the number of dimensions. Experimental results demonstrate the efficiency of the proposed algorithm.