Applying an Efficient k-Nearest Neighbor Search to Forest Attribute Imputation
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.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
Document Type: Research Article
Publication date: 2006-04-01
More about this publication?
- Forest Science is a peer-reviewed journal publishing fundamental and applied research that explores all aspects of natural and social sciences as they apply to the function and management of the forested ecosystems of the world. Topics include silviculture, forest management, biometrics, economics, entomology & pathology, fire & fuels management, forest ecology, genetics & tree improvement, geospatial technologies, harvesting & utilization, landscape ecology, operations research, forest policy, physiology, recreation, social sciences, soils & hydrology, and wildlife management.
Forest Science is published bimonthly in February, April, June, August, October, and December.
2016 Impact Factor: 1.782 (Rank 17/64 in forestry)
Average time from submission to first decision: 62.5 days*
June 1, 2016 to Feb. 28, 2017
Also published by SAF:
Journal of Forestry
Other SAF Publications
- Submit a Paper
- Membership Information
- Author Guidelines
- Ingenta Connect is not responsible for the content or availability of external websites