電機資訊學院: 資訊工程學研究所指導教授: 鄭卜壬侯廷璋Hou, Ting-ChangTing-ChangHou2017-03-032018-07-052017-03-032018-07-052016http://ntur.lib.ntu.edu.tw//handle/246246/275582最近鄰居法是一種在機器學習及資料探勘應用上相當常見的演算法。有相當多種方法可以實作最近鄰居法，其中樹狀結構演算法包含k維樹及球樹。球樹搜尋法是一種在高維度資料裡表現相當好的演算法。本工作專注於增進球樹搜尋法的效能。我們提出同心球樹搜尋法用來改變球樹的根結點結構。我們也提出了幾種策略法用來改變樹狀搜尋的順序。實驗結果顯示我們的方法能有效地降低拜訪的資料點個數及樹狀節點個數，以提升效能，節省不少搜尋時間。另外我們發現同心球樹在高維度的資料上表現相當良好，能增進更多的效能。最後我們的實驗也發現，如同傳統的球樹，同心球樹在不同的資料集的表現差異相當大。The K-nearest neighbors(KNN) is often a necessary algorithm in many machine learning and data mining applications.There are several tree structure algorithm to implement KNN, like K-d tree search and Ball-tree search.Ball-tree search is a powerful algorithm to search KNN for high dimension.In this work, we focus on improving the efficiency of ball-tree.We propose concentric ball-tree which change the leaf node structure of ball-tree.We also use several heuristic to change the traverse order of ball-tree search.We empirically show that our approach can improve the efficiency a lot to save search time of KNN by reducing the number of visited data points, the number of visited node in tree structure.In addition, we find that concentric ball-tree scale well with the number of dimensions. It can improve more efficiency for traditional ball-tree at high dimension.We also show that the performance of ball-tree is data driven, and so dose concentric ball-tree.1872509 bytesapplication/pdf論文公開時間: 2021/8/3論文使用權限: 同意有償授權(權利金給回饋學校)最近鄰居法球樹同心球樹策略法變動優先佇列K-nearest NeighborsBall-treeConcentric Ball-treeHeuristicUnstable Priority Queuethesis10.6342/NTU201601731http://ntur.lib.ntu.edu.tw/bitstream/246246/275582/1/ntu-105-R03922041-1.pdf