Treffer: Research and application of clustering algorithm for arbitrary data set

Title:
Research and application of clustering algorithm for arbitrary data set
Publisher Information:
IEEE Computer Society
Publication Year:
2009
Collection:
University College Dublin: Research Repository UCD
Document Type:
Konferenz conference object
File Description:
457320 bytes; application/pdf
Language:
English
ISBN:
978-0-7695-3336-0
0-7695-3336-1
Relation:
Proceedings : International Conference on Computer Science and Software Engineering : CSSE 2008 : Volume 04; http://hdl.handle.net/10197/1347
DOI:
10.1109/CSSE.2008.415
Accession Number:
edsbas.170FD3EF
Database:
BASE

Weitere Informationen

Paper presented at the 2008 International Conference on Computer Science and Software Engineering, December 12-14, 2008, Wuhan, China ; This paper discusses the theory and algorithmic design of the CADD (clustering algorithm based on object density and direction) algorithm. This algorithm seeks to harness the respective advantages of the k-means and DENCLUE algorithms. Clustering results are illustrated using both a simple data set and one from the geological domain. Results indicate that CADD is robust in that automatically determines the number K of clusters, and is capable of identifying clusters of multiple shapes and sizes. ; Science Foundation Ireland ; Conference details ; http://www.highsci.org/csse2008submission/website/csse/index.aspx