期刊名称：IOP Conference Series: Earth and Environmental Science
印刷版ISSN：1755-1307
电子版ISSN：1755-1315
出版年度：2018
卷号：108
期号：5
页码：052074
DOI：10.1088/1755-1315/108/5/052074
语种：English
出版社：IOP Publishing
摘要：K-Nearest Neighbor (KNN) classification algorithm is one of the simplest methods of data mining. It has been widely used in classification, regression and pattern recognition. The traditional KNN method has some shortcomings such as large amount of sample computation and strong dependence on the sample library capacity. In this paper, a method of representative sample optimization based on CURE algorithm is proposed. On the basis of this, presenting a quick algorithm QKNN (Quick k-nearest neighbor) to find the nearest k neighbor samples, which greatly reduces the similarity calculation. The experimental results show that this algorithm can effectively reduce the number of samples and speed up the search for the k nearest neighbor samples to improve the performance of the algorithm.
