首页    期刊浏览 2024年09月20日 星期五
登录注册

文章基本信息

  • 标题:K-Means and Spherical Clusters with Large Variance in Sizes
  • 本地全文:下载
  • 作者:Ahmed Fahim
  • 期刊名称:Computer Sciences and Telecommunications
  • 印刷版ISSN:1512-1232
  • 出版年度:2008
  • 卷号:15
  • 期号:01
  • 出版社:Internet Academy
  • 摘要:

    Data clustering is an important data exploration technique with many applications in data mining. The k-means algorithm is well known for its efficiency in clustering large data sets. However, this algorithm is suitable for spherical shaped clusters of similar sizes. The quality of the resulting clusters decreases when the data set contains spherical shaped clusters with large variance in sizes. In this paper, we introduce a simple idea to overcome this problem. Our experimental results reveal that our proposed algorithm produces satisfactory results

  • 关键词:K-Means; Data Clustering; Cluster Analysis.
国家哲学社会科学文献中心版权所有