计算机工程2013，Vol.39Issue(7)：26-30,44,6.DOI:10.3969/j.issn.1000-3428.2013.07.006
受限网络移动对象的概率最近邻查询
Probabilistic Nearest Neighbor Query of Constrained Network Moving Object
摘要
Abstract
Based on moving object probabilistic nearest neighbor query in free space,the concept of constrained network moving object Probabilistic Nearest Neighbor query(CNPNN) is put forward,and the CNPNN algorithm based on network probabilistic Voronoi diagram is proposed.The probabilistic measure based on the network distance is used to derive the network probabilistic Voronoi cells of the uncertain objects,and the network probabilistic Voronoi diagram is built to cover the constrained network.R+ tree is used to index network probabilistic Voronoi cells for decreasing search time.Network probabilistic Voronoi cell containing query object is located to acquire query object's most likely Nearest Neighbor(NN).Experimental results show that the time complexity of algorithm is O(n2+mlogmn),has a better performance under certain conditions.关键词
最近邻/受限网络/移动对象/概率最近邻/概率Voronoi图/R+树Key words
Nearest Neighbor(NN)/ constrained network/ moving object/ Probabilistic Nearest Neighbor(PNN)/ probabilistic Voronoi diagram/ R+tree分类
信息技术与安全科学引用本文复制引用
高峻,郝忠孝..受限网络移动对象的概率最近邻查询[J].计算机工程,2013,39(7):26-30,44,6.基金项目
黑龙江省自然科学基金资助项目(F200821) （F200821）
