UCSY's Research Repository

Clustering Documents by Using Harmony K-means Algorithm

Show simple item record

dc.contributor.author Win, Nwe War
dc.date.accessioned 2019-08-05T11:56:15Z
dc.date.available 2019-08-05T11:56:15Z
dc.date.issued 2009-12-30
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1770
dc.description.abstract Clustering is currently one of the most crucial techniques for dealing with massive amount of heterogeneous information on the web, which is beyond human being’s capacity to digest. Recent studies have shown that the most commonly used partitioning-based clustering algorithm, the K-means algorithm, is more suitable for large datasets. However, the K-means algorithm can generate a local optimal solution. This paper presents our work that aims to avoid these shortcomings by using Harmony K-means (HKA) algorithm. HKA deals with documents clustering based on harmony search optimization method that finds near global optimal clusters. en_US
dc.language.iso en en_US
dc.publisher Fourth Local Conference on Parallel and Soft Computing en_US
dc.title Clustering Documents by Using Harmony K-means Algorithm 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