计算机科学 ›› 2008, Vol. 35 ›› Issue (2): 140-143.
• • 上一篇 下一篇
袁妍 洪晓光
出版日期:
发布日期:
基金资助:
YUAN Yan ,HONG Xiao-Guang ( School of Computer Scienee and Technology, Shandong University, Jinan 250101)
Online:
Published:
摘要: 已往移动对象k近邻预测的研究中,有各种不确定性的分析以及对象本身预测位置不确定性的处理,而预测位置模糊不确定性导致其k近邻查询边界的粗糙不确定性的相关处理仍是空白。本文应用模糊-粗糙集的理论,先分析了已有方法得出的预测位置的模糊性,再用传统方法求得基于预测位置的扩展k+m近邻集,最后借助模糊-粗糙隶属函数来最终确定所求k近邻集合中的各个点。实验数据表明,本方法明显提高了k近邻集合相对移动对象实际位置的精确度。
关键词: 移动对象 k近邻查询 模糊集 粗糙集
Abstract: There are many analyses on the diversified uncertainty and many disposals on the uncertainty of objects' predicted position in the previous study of the prediction of moving objects' k-nearest neighbor. But there have not been any measure to deal with the
Key words: Moving object, K-nearest neighbor query, Fuzzy sets, Rough sets
袁妍 洪晓光. 基于模糊-粗糙集的移动对象k近邻预测[J]. 计算机科学, 2008, 35(2): 140-143. https://doi.org/
YUAN Yan ,HONG Xiao-Guang ( School of Computer Scienee and Technology, Shandong University, Jinan 250101). [J]. Computer Science, 2008, 35(2): 140-143. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2008/V35/I2/140
Cited