UCSY's Research Repository

The Fuzzy k-representatives Algorithm for Clustering Categorical Data

Show simple item record

dc.contributor.author Win, Than Htun
dc.contributor.author Hnin, Mya Than
dc.date.accessioned 2019-08-02T08:40:42Z
dc.date.available 2019-08-02T08:40:42Z
dc.date.issued 2009-08-03
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1675
dc.description.abstract This paper presents an algorithm which extends the fuzzy k-means algorithm for clustering categorical objects. In this algorithm, use a simple matching dissimilarity measure to deal with categorical objects and uses a frequency-based method to update the representative objects in the clustering process to minimize the clustering cost function. The fuzzy krepresentative algorithm is that it not only partition objects into clusters but also shows how confident an object is assigned to a cluster. The confidence is determined by the dissimilarity measures of an object to all cluster representatives. This paper is provided a method to find the fuzzy cluster representatives when the simple matching dissimilarity measure is used for categorical objects. en_US
dc.language.iso en en_US
dc.publisher Third Local Conference on Parallel and Soft Computing en_US
dc.title The Fuzzy k-representatives Algorithm for Clustering Categorical Data 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



Browse

My Account