1)  K-Nearest Neighbor Search
K最近邻搜索
2)  K-nearest neighbor
K-最近邻
1.
To further understand the quantitative structure-activity relationship(QSAR)of fluorine-containing pesticide and improve the prediction precision of QSAR models,a novel nonlinear combinatorial forecast me-thod named Multi-KNN-SVR,multi-K-nearest neighbor based on support vector regression,was proposed.
为深入认识含氟农药生物活性与其结构之间的关系,建立了理想的QSAR模型,从化合物油水分配系数等7个分子结构描述符出发,基于支持向量回归(SVR)和MSE最小原则,经自动寻找最优核函数和非线性筛选描述符,构建了多个K-最近邻(KNN)预测子模型。
3)  k-shortest path
k-最短路
1.
By combining k-shortest path algorithm with bi-objective decision-making method,a practical algorithm of acquiring the efficient paths for the bi-objective shortest path problem is developed.
通过综合k-最短路算法和双目标决策方法获得了双目标最短路问题的有效路径实用算法,该算法属多项式算法,可快速求出所有有效路径。
4)  k-nearest neighbors
k-最近邻
1.
Using the quality of reducing dimensions of Hilbert curve,the paper presents an approximate k-nearest neighbors query algorithm,and analyzes the quality of the approximate k-nearest neighbors.
利用Hilbert曲线的降维特性,该文提出基于Hilbert曲线近似k-最近邻查询算法AKNN,分析近似k-最近邻的误差。
2.
5, SLIQ, SPRINT, association rule, K-means, K-nearest neighbors, Bayesian network, artificial neural network and genetic algorithm, and their parallelism.
5,SLIQ,SPRINT,关联规则,K-平均值,K-最近邻,贝叶斯网络,人工神经网络,遗传算法及并行性进行了研究探讨,为数据挖掘研究者提供借鉴。
5)  K-nearest neighbor classifier
K-最邻近
6)  K nearest neighbor
K最近邻
参考词条
补充资料:Nearestneighbor(近邻取样)

nearest neighbor (近邻取样)

又被称为point sampling(点取样),是一种较简单材质影像插补的处理方式。会使用包含像素最多部分的图素来贴图。换句话说就是哪一个图素占到最多的像素,就用那个图素来贴图。这种处理方式因为速度比较快,常被用于早期3d游戏开发,不过材质的品质较差。

说明:补充资料仅用于学习参考,请勿用于其它任何用途。