Using genetic algorithms to optimize k-Nearest Neighbors configurations for use with airborne laser scanning data

摘要

The relatively small sampling intensities used by national forest inventories are often insufficient to produce the desired precision for estimates of population parameters unless the estimation process is augmented with auxiliary information, usually in the form of remotely sensed data. The k-Nearest Neighbors (k-NN) technique is a non-parametric, multivariate approach to prediction that has emerged as particularly popular for use with forest inventory and remotely sensed data and has been shown to contribute substantially to increasing precision. k-NN predictions are calculated as linear combinations of observations for sample units that are nearest in a space of auxiliary variables to the population unit for which a prediction is desired. Implementation of a nearest neighbors algorithm requires four choices: (i) a distance metric, (ii) specific auxiliary variables to be used with the distance metric, (iii) the number of nearest neighbors, and a (iv) scheme for weighting the nearest neighbors. Regardless of the choices for a distance metric and weighting scheme, emerging evidence suggests that optimization of the technique, including selection of an optimal subset of auxiliary variables, greatly enhances prediction. However, optimization can be computationally intensive and time-consuming. A promising approach that is gaining favor is based on genetic algorithms, a technique that uses search heuristics that mimic natural selection to solve optimization problems.