Applying an Efficient k-Nearest Neighbor Search to Forest Attribute Imputation

Author: Finley Andrew O.   McRoberts Ronald E.   Ek Alan R.  

Publisher: Society of American Foresters

ISSN: 0015-749X

Source: Forest Science, Vol.52, Iss.2, 2006-04, pp. : 130-135

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

This article explores the utility of an efficient nearest neighbor (NN) search algorithm for applications in multisource kNN forest attribute imputation. The search algorithm reduces the number of distance calculations between a given target vector and each reference vector, thereby decreasing the time needed to discover the NN subset. Results of five trials show gains in NN search efficiency ranging from 75 to 98% for k = 1. The search algorithm can be easily incorporated into routines that optimize feature subsets or weights, values of k, distance decomposition coefficients, and mapping.