1) K-NN search
K-近邻搜索
2) k-nearest neighbor search
k近邻搜索
1.
A new k-nearest neighbor search algorithm based on VA-File for relevance feedback image retrieval is introduced in this paper.
对向量近似方法中k近邻搜索算法加以改进,应用到基于相关反馈的交互式图像检索系统中。
4) k-nearest Neighbor search algorithm(KNNs)
k最近邻搜索算法
1.
k-nearest Neighbor search algorithm(KNNs) can not satisfy the needs of distributing,real time performance and expansibility for data mining.
k最近邻搜索算法无法满足数据挖掘的分布性、实时性和可扩展性要求,针对该问题提出基于P2P的自适应分布式k最近邻搜索算法[0](P2PAKNNs)。
5) neighbor finding
邻近搜索
1.
The algorithm of neighbor finding from back to front with decomposing Quaternary code is presented.
分析了球面Quaternary编码的特点,给出了三角格网方向判断的规则,并对该算法与Bartholdi邻近搜索算法的时间复杂度进行了对比。
2.
A neighbor finding algorithm is presented in details,and the relationships between diamonds and hierarchy,diamond and grid,and grids and hierarchy are constructed using their adjacent .
用线性四叉树成熟的Morton编码作为关键字来标识菱形块,发展了具有固定方向(fixed orientation)的“块”层次编码技术及邻近搜索算法。
6) nearest neighbor searching
近邻搜索
1.
This predictor takes the K nearest neighbor searching method to gain the K neighbors of the sample to be predicted,trains a RBF network with these neighbors,and predicts the sample with well trained RBF network.
该模型采用K最近邻搜索方法得到待预测样本的K个近邻,用近邻样本进行RBF神经网络建模,用训练好的RBF神经网络对待预测样本进行预测。
补充资料：Nearestneighbor(近邻取样)
nearest neighbor (近邻取样)
又被称为point sampling(点取样)，是一种较简单材质影像插补的处理方式。会使用包含像素最多部分的图素来贴图。换句话说就是哪一个图素占到最多的像素，就用那个图素来贴图。这种处理方式因为速度比较快，常被用于早期3d游戏开发，不过材质的品质较差。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条