...率要求更高，这里介绍是一种基本的查询算法--最近邻（Nearest Neighbor ）或K近邻(KNN)。最近邻搜索（Nearest Neighbor Search）：最近邻查询是最重要的空间查询之一，也是文本着重考虑的类型。
基于2240个网页-相关网页
In the part of codeword searching algorithms, the thesis discussed fast codeword search algorithms based on absolute error inequality, triangle inequality, norm inequality and especially the algorithm based on equal-average nearest neighbor search and equal-average equal-variance nearest search.
对绝对误差不等式、三角不等式和范数不等式等排除算法进行了研究,重点探讨了等均值最近邻搜索算法和等均值等方差最近邻搜索算法的原理。
参考来源 - 图像压缩中矢量量化技术研究·2,447,543篇论文数据，部分数据来源于NoteExpress
改进后的算法缩小了最近邻点的搜索范围，提高了运算效率。
In the improved algorithm, the search field for the nearest neighbor is reduced, resulting in increased efficiency.
实验结果表明，该算法的运算时间是改进的等均值等方差最近邻域搜索(IEENNS)算法的80%左右。
The experimental results show that the computing time for the new algorithm is 80% that of the improved equal-average equal-variance nearest-neighbor search (IEENNS) algorithm.
对改进的标准问题进行测试，同时与最近邻域搜索算法的结果作比较，结果表明算法是有效的。
Compared to nearest neighborhood search algorithm, the algorithm was verified to be efficient through a number of standard test cases.
应用推荐