English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 616131      Online Users : 73
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51102

Title: Fast Agglomerative Clustering Using Information of k Nearest Neighbors
Authors: Chih-Tang Chang
Jim Z. C. Lai
M. D. Jeng
Contributors: 國立臺灣海洋大學電機工程學系
Date: 2010-12
Issue Date: 2018-11-13
Publisher: Pattern Recognition
Abstract: Abstract: In this paper, we develop a method to lower the computational complexity of pairwise nearest neighbor (PNN) algorithm. Our approach determines a set of candidate clusters being updated after each cluster merge. If the updating process is required for some of these clusters, k-nearest neighbors are found for them. The number of distance calculations for our method is O(N2), where N is the number of data points. To further reduce the computational complexity of the proposed algorithm, some available fast search approaches are used. Compared to available approaches, our proposed algorithm can reduce the computing time and number of distance calculations significantly. Compared to FPNN, our method can reduce the computing time by a factor of about 26.8 for the data set from a real image. Compared with PMLFPNN, our approach can reduce the computing time by a factor of about 3.8 for the same data set.
Relation: 43(12) pp.3958-3968
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51102
Appears in Collections:[電機工程學系] 期刊論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback