Finding Most Frequent Path based on Stratified Urban Roads

Enquan Ge, Jian Xu, Ming Xu, Ning Zheng, Weige Wang, Xinyu Zhang

Abstract

The path query based on big trajectory data has become a promising research direction due to the rapid development of the Internet. Previous studies mainly focus on searching paths in full road network and ignore the importance of stratified urban roads. It is observed that higher-level roads gather more trajectory points which means most drivers prefer the high-level road. In this paper, we study a new path query to find the most frequent path (MFP) based on road levels in large-scale historical trajectory data. We refer to this query as most frequent path based on road levels (RLMFP). Intuitively, selecting roads which are in line with local custom and choosing high-level roads such as high-way are people’s two common sense notions. Our query not only satisfies aforementioned sense, but also has two advantages in algorithm implementation. First, the road hierarchy can speed up the path query. Next, the trajectory data can find more reasonable upgrade points (e.g., path query based on road levels need to find the intersection between low-level roads and high-level roads). Experiments show the effectiveness and the efficiency of our method.

References

  1. Akiba, T., Iwata, Y., and Yoshida, Y. (2013). Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pages 349-360.
  2. Bast, H., Funke, S., Matijevic, D., Demetrescu, C., Goldberg, A., and Johnson, D. (2006). Transit: Ultrafast shortest-path queries with linear-time preprocessing. 9th DIMACS Implementation Challenge - Shortest Path / Demetrescu, Camil ; Goldberg, Andrew ; Johnson, David, (2006):175-192.
  3. Bellman, R. (1958). On a routing problem. Quarterly Appl Math, 16:87-90.
  4. Brinkhoff, T. (2002). A framework for generating networkbased moving objects. Geoinformatica, 6(2):153-180.
  5. Chen, Z., Shen, H.T., and Zhou,X.(2011). Discovering popular routes from trajectories. Icde,6791(9):900-911
  6. Dijkstra, E.W.(1959), A note on two problems in connexion with graphs. Numerische Mathematik,1(1):269-271
  7. Ding, B., Yu, J. X., and Qin, L. (2008). Finding timedependent shortest paths over large graphs. Proc Edbt, pages 205-216.
  8. Geisberger, R., Sanders, P., Schultes, D., and Delling, D. (2008). Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. Springer Berlin Heidelberg.
  9. Gonzalez, H., Han, J., Li, X., Myslinska, M., and Sondag, J. P. (2007). Adaptive fastest path computation on a road network: A traffic mining approach. In In Proc. 2007 Int. Conf. on Very Large Data Bases (VLDB07, pages 794-805.
  10. Hart, P. E., Nilsson, N. J., and Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. Systems Science & Cybernetics IEEE Transactions on, 4(2):100-107.
  11. Jing, N., Huang, Y. W., and Rundensteiner, E. A. (1996). Hierarchical optimization of optimal path finding for transportation applications. In In Proc of Acm Conference on Information & Knowledge Management, pages 261-268.
  12. Kanoulas, E., Du, Y., Xia, T., and Zhang, D. (2006). Finding fastest paths on a road network with speed patterns. In In Proc. Int. Conf. on Data Engineering (ICDE06, pages 10-10.
  13. Leong, H. U., Zhao, H. J., Man, L. Y., Li, Y., and Gong, Z. (2014). Towards online shortest path computation. IEEE Transactions on Knowledge & Data Engineering, 26(4):1012-1025.
  14. Luo, W., Tan, H., Chen, L., and Ni, L. M. (2013). Finding time period-based most frequent path in big trajectory data. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pages 713-724.
  15. Pohl, I. (1971). Bi-directional search. Machine IntelligenceC, 6:1359-1364.
  16. Shang, S., Deng, K., and Zheng, K. (2010). Efficient best path monitoring in road networks for instant local traffic information. In Conferences in Research and Practice in Information Technology Series, pages 47-56.
  17. Su, H., Zheng, K., Huang, J., Jeung, H., Chen, L., and Zhou, X. (2014). Crowdplanner: A crowd-based route recommendation system. In 2014 IEEE 30th International Conference on Data Engineering (ICDE), pages 1144-1155.
  18. Yuan, J., Zheng, Y., Xie, X., and Sun, G. (2011). Driving with knowledge from the physical world. Kdd, pages316-324.
  19. Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., and Huang, Y. (2010) T-drive: driving directions based on taxi trajectories. In Proceedings of the 18th SIGSPATIAL International conf. on advances in geographic information systems, pages 99-108 ACM.
Download


Paper Citation


in Harvard Style

Ge E., Xu J., Xu M., Zheng N., Wang W. and Zhang X. (2016). Finding Most Frequent Path based on Stratified Urban Roads . In Proceedings of the 2nd International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM, ISBN 978-989-758-188-5, pages 51-60. DOI: 10.5220/0005880500510060


in Bibtex Style

@conference{gistam16,
author={Enquan Ge and Jian Xu and Ming Xu and Ning Zheng and Weige Wang and Xinyu Zhang},
title={Finding Most Frequent Path based on Stratified Urban Roads},
booktitle={Proceedings of the 2nd International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,},
year={2016},
pages={51-60},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005880500510060},
isbn={978-989-758-188-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,
TI - Finding Most Frequent Path based on Stratified Urban Roads
SN - 978-989-758-188-5
AU - Ge E.
AU - Xu J.
AU - Xu M.
AU - Zheng N.
AU - Wang W.
AU - Zhang X.
PY - 2016
SP - 51
EP - 60
DO - 10.5220/0005880500510060