DocumentCode
3037734
Title
K-Means Divide and Conquer Clustering
Author
Khalilian, Madjid ; Boroujeni, Farsad Zamani ; Mustapha, Norwati ; Sulaiman, Nasir
Author_Institution
Fac. of Comput. Sci. & Inf. Technol.(FSKTM) Selangor Darul Ehsan, Univ. Putra Malaysia (UPM), Selangor
fYear
2009
fDate
8-10 March 2009
Firstpage
306
Lastpage
309
Abstract
Cluster analysis, primitive exploration with little or no prior knowledge, consists of research developed across a wide variety of communities. Most clustering techniques ignore the fact about the different size or levels - where in most cases, clustering is more concern with grouping similar objects or samples together ignoring the fact that even though they are similar, they might be of different levels. For really large data sets, data reduction should be performed prior to applying the data-mining techniques which is usually performing dimension reduction, and the main question is whether some of these prepared and preprocessed data can be discarded without sacrificing the quality of results. Existing clustering techniques would normally merge small clusters with big ones, removing its identity. In this study we propose a method which uses divide and conquer technique to improve the performance of the k-means clustering method.
Keywords
data mining; divide and conquer methods; pattern clustering; cluster analysis; data-mining techniques; dimension reduction; k-means divide and conquer clustering; primitive exploration; Automation; Clustering methods; Computer science; Euclidean distance; Extraterrestrial measurements; History; Humans; Information analysis; Knowledge engineering; Multidimensional systems; Clustering; Euclidean Space; High Dimensional Data; K-Means; Object Similarity;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Automation Engineering, 2009. ICCAE '09. International Conference on
Conference_Location
Bangkok
Print_ISBN
978-0-7695-3569-2
Type
conf
DOI
10.1109/ICCAE.2009.59
Filename
4804538
Link To Document