Considering K Nearest Neighbor(KNN) ( KNN ) method has high accuracy but poor efficiency, this paper proposes a text categorization method based on the guidance of posterior probability named B-KNN. 针对K最近邻(KNN)方法分类准确率高但分类效率较低的特点,提出基于后验概率制导的贝叶斯K最近邻(B-KNN)方法。
Scalable processing of multiple continuous k nearest neighbor queries in road networks 可伸缩的道路网络多连续k近邻查询处理
Two-tier K Nearest Neighbor(KNN) Algorithm Based on Active Diagnostic Recommendation 基于主动诊断推荐的双层K-最近邻算法
Therefore, moving object index strategy and K nearest neighbor query strategy need to be studied. 因此需要研究基于路网的移动对象索引策略和K近邻查询策略,如何采用快速、有效的方法来处理移动对象K近邻查询是一个具有挑战性的研究课题。
K nearest neighbor ( kNN ) query is one of the fundamental issues in spatial database research area. k最近邻居问题(kNN)是空间数据库研究领域最基本的问题之一,是指在特定空间中寻找离查询点最近的k个目标点,包括几何空间,道路空间等。