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
Best First and Concentric Ball Tree : Improving Efficiency of K-Nearest Neighbors Search
侯廷璋 , Masters Advisor：鄭卜壬
英文
DOI：
10.6342/NTU201601731
最近鄰居法 ； 球樹 ； 同心球樹 ； 策略法 ； 變動優先佇列 ； K-nearest Neighbors ； Ball-tree ； Concentric Ball-tree ； Heuristic ； Unstable Priority Queue
- [2] J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18:509–517, September 1975.
連結：
- [3] N. Bhatia and Vandana. Survey of nearest neighbor techniques. CoRR, abs/1007.0085, 2010.
連結： - [4] J. Chen, H.-r. Fang, and Y. Saad. Fast approximate knn graph construction for high dimensional data via recursive lanczos bisection. J. Mach. Learn. Res., 10:1989–2012, Dec. 2009.
連結：
- [5] T. Cover and P. Hart. Nearest neighbor pattern classification. IEEE Trans. Inf. Theor., 13(1):21–27, Sept. 2006.
連結： - [6] M. Dolatshah, A. Hadian, and B. Minaei-Bidgoli. Ball*-tree: Efficient spatial indexing for constrained nearest-neighbor search in metric spaces. CoRR, abs/1511.00628, 2015.
連結：
