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

文章基本信息

  • 标题:Clustering Analysis of Simple K – Means Algorithm for Various Data Sets in Function Optimization Problem (Fop) of Evolutionary Programming
  • 本地全文:下载
  • 作者:R. Karthick ; Dr. Malathi.A
  • 期刊名称:International Journal of Innovative Research in Science, Engineering and Technology
  • 印刷版ISSN:2347-6710
  • 电子版ISSN:2319-8753
  • 出版年度:2015
  • 卷号:4
  • 期号:5
  • 页码:2762
  • DOI:10.15680/IJIRSET.2015.0405015
  • 出版社:S&S Publications
  • 摘要:Evolutionary Algorithms are based on some influential principles like Survival of the Fittest and withsome natural phenomena in Genetic Inheritance. The key for searching the solution in improved function optimizationproblems are based only on Selection and Mutation operators. In this paper a Selection algorithm for data set is chosenso as to identify the survival of the fittest and also the simple K means clustering algorithm is analyzed on differentdata sets to check for the performance of the K – means on different data set which gives best accuracy to identify thebest solution.
  • 关键词:Evolutionary Programming; Function Optimization; Genetic Algorithm K-means clustering
国家哲学社会科学文献中心版权所有