1) K nearest neighbors sets
K近邻点集
2) k-nearest points
k邻近点
1.
The vertex deformation gradient is defined by its k-nearest points,and a closed-form solution is obtained through energy optimization.
顶点的变形梯度由顶点的k邻近点决定,并从能量优化的角度得出了顶点变形梯度的一个闭合解。
3) near neighbour point set
近邻点集
1.
Firstly, group targets measurements (group measurements for short) were extracted based on the combination of the near neighbour point sets from the measurements set of individual member t.
首先,在近邻点集聚合的基础上,从传感器给出的单目标观测集合中提取出阵群目标观测(简称阵群观测);其次,按照自顶向下的方式逐次计算各个阵群观测不同子集空间分布的距离度量,并以此为基础计算阵群观测之间的关联度量;最后,通过在关联代价矩阵上应用二维分配算法得到不同时刻各个阵群观测之间的对应关系。
4) K neighbours candidate list
K近邻候选集
5) k-th nearest neighbor point
k个最近邻居点
6) K-nearest neighbor
K-最近邻
1.
Development and improvement of K-Nearest Neighbor clustering technique
K-最近邻分类技术的新发展与技术改进
2.
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.
In order to improve the predication precision of quantitative structure-activity relationship(QSAR) model,a novel combinatorial k-nearest neighbor method based on support vector machine regression(SVR-CKNN) was proposed,which could screen descriptors automatically and then builds several k-nearest neighbor models for combinatorial forecast.
该法基于支持向量机回归(SVR)自动筛选化合物结构描述符,以k-最近邻建立多个子模型实施组合预测(CKNN)。
补充资料：点集拓扑
点集拓扑学（point set topology），有时也被称为一般拓扑学（general topology），是数学的拓扑学的一个分支。它研究拓扑空间以及定义在其上的数学构造的基本性质。这一分支起源于以下几个领域：对实数轴上点集的细致研究，流形的概念，度量空间的概念，以及早期的泛函分析。它的表述形式大概在1940年左右就已经成文化了。通过这种可以为所有数学分支适用的表述形式，点集拓扑学基本上抓住了所有的对连续性的直观认识。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条