A Logarithmic-Complexity Algorithm for Nearest Neighbor Classification Using Layered Range Trees ()
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.
Share and Cite:
I. Al-Bluwi and A. Elnagar, "A Logarithmic-Complexity Algorithm for Nearest Neighbor Classification Using Layered Range Trees,"
Intelligent Information Management, Vol. 4 No. 2, 2012, pp. 39-43. doi:
10.4236/iim.2012.42006.
Cited by
No relevant information.