| 球面上的K最近邻查询算法 |
| |
| 引用本文： | 张丽平,李松,郝晓红.球面上的K最近邻查询算法[J].计算机工程,2011,37(2):52-53. |
| |
| 作者姓名： | 张丽平 李松 郝晓红 |
| |
| 作者单位： | 1. 哈尔滨理工大学计算机科学与技术学院,哈尔滨,150080
2. 哈尔滨理工大学计算中心,哈尔滨,150080 |
| |
| 基金项目： | 黑龙江省教育厅科学技术研究基金资助项目(11551084) |
| |
| 摘 要： | 针对球面上数据对象点集的特征和K最近邻查询的需求,提出2种处理球面上K最近邻查询的算法:基于查询轴的K最近邻查询算法(PAM方法)和基于查询圆面的K最近邻查询算法(PCM方法).对2种算法进行实验比较,结果表明,PAM方法和PCM方法都适合处理球面上的最近邻查询问题,PAM方法在存储量和查询复杂度方面相对于PCM方法具...
|
| 关 键 词： | 最近邻 球面 查询轴 查询圆面 索引结构 |
Algorithms for K-Nearest Neighbor Query on Sphere |
| |
| ZHANG Li-ping,LI Song,HAO Xiao-hong.Algorithms for K-Nearest Neighbor Query on Sphere[J].Computer Engineering,2011,37(2):52-53. |
| |
| Authors: | ZHANG Li-ping LI Song HAO Xiao-hong |
| |
| Affiliation: | ZHANG Li-pinga,LI Songa,HAO Xiao-hongb(a.School of Computer Science and Technology,b.Computation Center,Harbin University of Science and Technology,Harbin 150080,China) |
| |
| Abstract: | According to the characteristics of the datasets on the sphere,the algorithm of the K-Nearest Neighbor query based on the query axis(PAM) and the algorithm of the K-Nearest Neighbor query based on the query circular planar(PCM) are presented.Theoretical research and experimental results show that both the two methods can handle the problem of the K-Nearest Neighbor query on the sphere,compared with the PCM,PAM has advantages on the memory capacitance and the query efficiency,but the expansibility of PAM is ... |
| |
| Keywords: | nearest neighbor sphere query axis query circular planar index structure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
|
