DOI
stands for Digital Object Identifier
（
D
igital
O
bject
I
dentifier
）
,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.
Using DOI as a persistent link
To create a persistent link, add「http://dx.doi.org/」
「
http://dx.doi.org/
」
before a DOI.
For instance, if the DOI of an article is
10.5297/ser.1201.002
, you can link persistently to the article by entering the following link in your browser:
http://dx.doi.org/
10.5297/ser.1201.002
。
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.
Cite a document with DOI
When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.
DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI Registration （ doi.airiti.com ） 。
Export
Track
E-mail To Friend
Print Bibliography
Report an Issue
Search in Library
Efficiently Mining Top-K Shortest Paths within a Travel Time Constraint in Road Networks
林家慶 , Masters Advisor：曾新穆
繁體中文
路徑推薦 ； 最短路徑 ； 導覽路徑 ； 全球定位系統 ； 資料探勘 ； Global positioning system ； Shortest path ； Data mining. ； Navigation paths ； Path recommendation
- [2].R. Agrawal and R.Srikant. Fast Algorithms for Mining Association Rules, In Proceeding of the 20th Very Large Data Bases, pages 487-499, Santiago, Chile, 1994.
連結：
- [4].A. Awasthi, Y. Lechevallier, M. Parent, and J. M. Proth. Rule based prediction of fastest paths on urban networks. In Proceedings of the 8th International IEEE Conference on Intelligent Transportation Systems, Vienna, Austria, September, 2005.
連結：
- [10].C. H. Cheong, and M. H. Wong. Mining Popular Paths in a Transportation Database System with Privacy Protection. In Proceedings of the 22nd International Conference on Data Engineering Workshops, 2006.
連結：
- [11].H. D. Chon, D. Agrawal, and A. El. Abbadi, FATES: Finding A Time dEpendent Shortest path. In Proceedings of the 4th International Conference on Mobile Data Management, Melbourne, Australia. pages 165–180, 2003.
連結： - [12].E. W. Dijkstra. A Note on Two Problems in Connection with Graphs. Numerische Mathematik , Vol. 1, No. 1, pages 269-271, December 1959.
連結：
