nearest neighbor algorithm 最近邻居算法 ; 本文引入最近相邻算法 ; 最近相邻算法
nearest neighbor-clustering algorithm 最近邻聚类算法
k-nearest neighbor algorithm K最邻近算法 ; 最邻近算法 ; 近邻算法 ; 算法
nearest-neighbor algorithm 最小距离算法
the nearest neighbor algorithm 最近邻算法
fast nearest neighbor algorithm 快速近邻法
edit-nearest-neighbor algorithm 剪辑近邻法
kernel nearest neighbor algorithm 核最近邻算法
To answer the question "What is Customer No. 5 most likely to buy?" based on the Nearest Neighbor algorithm we ran through above, the answer would be a book.
如果使用最近邻算法回答我们上面遇到的“第5个顾客最有可能购买什么产品”这一问题，答案将是一本书。
The Nearest Neighbor algorithm can be expanded beyond the closest match to include any number of closest matches.
最近邻算法可被扩展成不仅仅限于一个最近匹配，而是可以包括任意数量的最近匹配。
The final challenge with the Nearest Neighbor technique is that it has the potential to be a computing-expensive algorithm.
最近邻技术最后的一个挑战是该算法的计算成本有可能会很高。
应用推荐