簡易檢索 / 詳目顯示

回結果列表
研究生： 林 萱
Lin, Shian
論文名稱： 尋找地標定義下前k短路徑之系統及其更新
Landmark-Based Top-k Shortest Paths with Updates
指導教授： 韓永楷
HON, WING-KAI
口試委員: 李哲榮
蔡孟宗
學位類別： 碩士
Master
系所名稱： 電機資訊學院 - 資訊系統與應用研究所
Institute of Information Systems and Applications
論文出版年： 2022
畢業學年度： 110
語文別： 英文
論文頁數： 23
中文關鍵詞： 前k短路徑問題 、前k短多樣路徑 、地標 、個人化路徑 、最短路徑問題
外文關鍵詞： path diversity, landmark-based, personalized route recommendation
相關次數： 點閱：1  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 經典的「Top-k最短路徑問題」在導航和地圖系統中一直發揮著重要角色。在現實世界的場景中，若能根據人們的偏好推薦最短路徑將改善整體體驗。在這篇論文中，我們 將路徑的多樣性也納入考量，以近年來被提出的「前k短多樣路徑問題」為延伸，先建立可以降低尋找前k最短路徑的複雜性的一個圖(Graph) 的索引，再定義出如何建立 一個可以推薦出個人化路徑的系統架構。此外，我們也會透過參考真實世界的交通資訊，對圖的索引作部分的更新，以提高每次查詢的準確度。實驗結果展示了本論文之模型與傳統模型相比效率上有所提高。

    The classical top-k shortest path problem has always played a significant role in navigation and mapping systems. In a real-world scenario, recommending the shortest route based on people’s preferences will improve the overall experience. In this thesis, we build an index based on a graph to reduce the complexity of finding the top-k shortest paths, which is augmented with a space-efficient personalized index to incorporate users’ preferences. Additionally, we show how to update the index by referring to real-time traffic information to enhance the precision and robustness of the query. Our experiment results show that the new model has better performance (both in efficiency and accuracy) when compared to the traditional model.

    1 Introduction 1 2 Related Work 5 2.1 Top-k Shortest Paths with Landmark-Based Diversity...................... 5 2.2 User Preference .......................... 6 2.3 Traffic Paths .......................... 6 3 Problem Definition 7 4 Algorithm 9 4.1 Baseline.......................... 9 4.2 Our Framework ....................... 10 4.3 Performance Analysis.......................... 12 5 Evaluation 15 5.1 Experimental Setup........................... 15 5.2 Experimental Results.......................... 16 6 Conclusion 21

    [1] H. Liu, C. Jin, B. Yang, and A. Zhou, “Finding Top-k Shortest Paths with Diversity,” in Proceedings of International Conference on Data Engineering (ICDE), pp. 488–502, 2018.
    [2] J.-W. Hsu, “Finding Top-k Shortest Paths under Landmark-Based Diversity: Indexing and Experiment,” Master’s thesis, National Tsing Hua University, 2020.
    [3] P. H. Li, M. L. Yiu, and K. Mouratidis, “Historical Traffic-Tolerant Paths in Road Networks,” in Proceedings of International Conference on Advances in Geographic Information Systems (SIGSPATIAL), pp. 477––480, 2014.
    [4] J. Y. Yen, “Finding the K Shortest Loopless Paths in a Network,” Management Science, vol. 17, no. 11, pp. 712–716, 1971.
    [5] D. Eppstein, “Finding the k Shortest Paths,” in Proceedings of Annual Symposium on Foundations of Computer Science (FOCS), pp. 154–165, 1994.
    [6] J. Dai, B. Yang, C. Guo, and Z. Ding, “Personalized Route Recommendation using Big Trajectory Data,” in Proceedings of International Conference on Data Engineer (ICDE), pp. 543–554, 2015
    [7] F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios, and S.-H. Teng, “On Trip Planning Queries in Spatial Databases,” in Advances in Spatial and Temporal Databases, pp. 273–290, 2005.
    [8] D. A. Bader and K. Madduri, “GTgraph: A Synthetic Graph Generator Suite,” 2006.
    https://github.com/dhruvbird/GTgraph.
    [9] Y. Qi, “An Implementation of the k-Shorest-Paths Algorithm in Cpp,” 2015.
    https://github.com/yan-qi/k-shortest-paths-cpp-version

    QR CODE