By Topic

Research on K Nearest Neighbor Non-parametric Regression Algorithm Based on KD-Tree and Clustering Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zheng-Wu Yuan ; Coll. of Comput. Sci. & Technol., Chongqing Univ. of Posts & Telecommun., Chongqing, China ; Yuan-Hui Wang

Regarding to the limitations of the existing K nearest neighbor non-parametric regression methods, spatial autocorrelation analysis is used to determine the state vector in this paper. In order to improve the speed of searching data, this paper uses the method of clipping samples to reduce data storage and split the sample quickly by KD-Tree. It also reduces the search volume of the nearest neighbor through the pruning principle of KD-Tree, gets the subset by proportional sampling in the KD-Tree subset, and runs K-Means clustering multiple times. Then the optimal K value is selected which can improve the forecast error of the uniform K value on the traditional non-parametric regression. The experimental results show that improved forecasting method is superior to the traditional method.

Published in:

Computational and Information Sciences (ICCIS), 2012 Fourth International Conference on

Date of Conference:

17-19 Aug. 2012