计算机应用与软件2018，Vol.35Issue(2)：7-15,73,10.DOI:10.3969/j.issn.1000-386x.2018.02.002
隐马尔可夫模型路网匹配的MapReduce实现
MAP MATCHING WITH HIDDEN MARKOV MODEL ON MAPREDUCE
摘要
Abstract
Off-line map matching pursues higher matching accuracy in view of the whole trajectory.There were studies trying to use distributed computation framework to realize the research since the map segmentation fails to achieve road connectivity,which slashes the consideration of matching accuracy.On the other hand,the former researches were limited to small maps due to lack of the efficient management of large-scale map data applied with map matching.Thus, firstly the distributed Hidden Markov model is proposed.The model is able to calculate the Hidden Markov model which is a map matching algorithm with high accuracy on the distributed calculation framework by taking advantage of the severability of Viterbi algorithm.Without losing matching accuracy, the segmental management of map matching according to geographic location is realized,accelerating map matching 50%by cutting I/O cost.关键词
路网匹配/MapReduce/隐马尔可夫模型Key words
Map mathing/MapReduce/Hidden Markov model分类
信息技术与安全科学引用本文复制引用
陆健,王鹏..隐马尔可夫模型路网匹配的MapReduce实现[J].计算机应用与软件,2018,35(2):7-15,73,10.基金项目
国家自然科学基金项目(61672163,61170006) （61672163,61170006）
中国科技部国家重点研发计划项目(2016YFB1000700). （2016YFB1000700）
