Article citationsMore>>

G. S. Lueker, “A Data Structure for Orthogonal Range Queries,” Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, Ann Arbor, 16-18 October 1978, pp. 28-34.

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.