UCSY's Research Repository

Acomparative study of K-Means and KMIX Clustering methods

Show simple item record

dc.contributor.author Lwin, No No Saw
dc.date.accessioned 2019-07-26T05:26:08Z
dc.date.available 2019-07-26T05:26:08Z
dc.date.issued 2011-12-29
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1356
dc.description.abstract Clustering is the processof grouping the similar objects into the same group and produce characteristic for each cluster. Partition-based clustering algorithms are simple to implement. K-Means is one of the partition based clustering methods but it only work well on conditions include categorical data like medical fields. K-Means clustering need to transform categorical value to appropriate numeric form. KMIX clustering use simple matching dissimilarity measure for categorical value and replace mode instead of using mean for center vector. This system implements K-Means and KMIX algorithms on Zoo Small data set and Heart disease data set from UCI Machine Learning Repository. And then the clustering performance of these two algorithms are compared. According to experimental results, KMIX clustering is effective on data domain containing mixed type of numerical and categorical attributes. en_US
dc.language.iso en en_US
dc.publisher Sixth Local Conference on Parallel and Soft Computing en_US
dc.title Acomparative study of K-Means and KMIX Clustering methods en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account