Flinders University Flinders Academic Commons
 

Flinders Academic Commons >
Flinders Digital Archive >
Science and Engineering >
Computer Science, Engineering and Mathematics  >
Computer Science, Engineering and Mathematics - Collected Works >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2328/25786

Title: Efficient search approaches for K-medoids-based algorithms
Authors: Chu, S-C
Roddick, John Francis
Chen, Tsong-Yi
Pan, Jeng-Shyang
Keywords: Computational complexity
Pattern clustering
Search problems
Issue Date: 2002
Publisher: Institute of Electrical and Electronics Engineers Computer Society (IEEE Publishing)
Citation: Chu, S.-C., Roddick, J., Chen, T.-Y. and Pan, J.-S. 2002. Efficient search approaches for K-medoids-based algorithms. 2002 IEEE Conference on Computers, Communications, Control and Power Engineering, vol. 1, 712a - 715a.
Abstract: In this paper, the concept of previous medoid index is introduced. The utilization of memory for efficient medoid search is also presented. We propose a hybrid search approach for the problem of nearest neighbor search. The hybrid search approach combines the previous medoid index, the utilization of memory, the criterion of triangular inequality elimination and the partial distance search. The proposed hybrid search approach is applied to the k-medoids-based algorithms. Experimental results based on Gauss-Markov source, curve data set and elliptic clusters demonstrate that the proposed algorithm applied to the CLARANS algorithm may reduce the number of distance calculations from 88.4% to 95.2% with the same average distance per object compared with CLARANS. The proposed hybrid search approach can also be applied to nearest neighbor searching and the other clustering algorithms.
URI: http://hdl.handle.net/2328/25786
ISBN: 0780374908
Appears in Collections:Computer Science, Engineering and Mathematics - Collected Works

Files in This Item:

File Description SizeFormat
Chu Efficient.pdf451.48 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback