会议专题

A new K-NN Query algorithm based on the Clustering and sorting of Minimum Bounding Rectangle

The K-neighbor query algorithm is an Important class of search algorithm in the spatial database, this paper will adopt the K-means algorithm to carry on sorting to the smallest enclosing rectangle in accordance with orientation relationship based on the measurement of distance and pruning strategies of MBR in die traditional K-nearest neighbor query, it can carry on the K-neighbor queries after sorting, as a result, die new algorithm can omit the need of a great amount of distance calculation between the queried object and the MBR as well as the need of the judgment when carry on pruning, the experiment shows that the algorithm query efficiency is enhanced, and has a wide range of applications in practice.

K-NN quay algorithm K-means algorithm Measuring distance pruning strategy sorting

Guobin Li JineTang

School of Computer Science and Technology Henan Polytechnic University Jiaozuo,China

国际会议

2010 Second International Conference on Intelligent Human-Machine Systems and Cybernetics(第二届智能人机系统与控制论国际学术会议 IHMSC 2010)

南京

英文

196-199

2010-08-26(万方平台首次上网日期,不代表论文的发表时间)