Evolutionary K-means Clustering Algorithm

سال انتشار: 1395
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 362

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

ICEEE08_235

تاریخ نمایه سازی: 11 مرداد 1396

چکیده مقاله:

Clustering techniques have received attention in many fields of study such as engineering, medicine, biology and data mining. The aim of clustering is to collect data points. The K-means algorithm is one of the most common techniques used for clustering. However, the results of K-means depend on the initial state and converge to local optima. In order to overcome local optima obstacles, a lot of studies have been done in clustering. This paper presents an efficient hybrid evolutionary optimization algorithm based on combining Modify gravitational search algorithm and K-means for optimum clustering N objects into K clusters. Experiments with 1 bench-mark datasets have shown similar or slightly better quality of the results compared to standard K-Means algorithm and other algorithm. The experiment results show that proposed algorithm clustering has not only higher accuracy but also higher level of stability. And the faster convergence speed can also be validated by statistical results.

نویسندگان

Gholam reza eslaminezhad

Department Of Electrical Engineering, College of Engineering ,Marvdasht Branch, Islamic Azad University, Marvdasht, Iran

Malihe sabeti

Department Of Computer Engineering, College Of Engineering, Shiraz Branch, Islamic Azad University, Shiraz , Iran

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • G. Gan, C. Ma, J. Wu, Data Clustering : Theory ...
  • P. Berkhin, Survey of Clustering Data Mining Techniques, third ed., ...
  • A. K. Jain, Data clustering :50 years beyond k-means, Pattern ...
  • D. Aloise, P. Hansen, L. LibertiAn, Improved column generation algorithm ...
  • E. Forgy, Cluster analysis of multivariate data: efficiency VSs. interpretab ...
  • M. E. Celebi, H. Kingravi, P. A. Vela, A comparative ...
  • B. Zhang, M. Hsu, U. Dayal, K-Harmonic Means: A data ...
  • Iris dataset (n=150, d=4, k=3): This dataset was collected by ...
  • A. Hatamlou, S. Abdullah, H. Nezamabadi -pour, A combined approach ...
  • S.C. Tan, Simplifying and improving swarm-based clustering, in: Proceeding Sof ...
  • S. Fong, S. Deb, X.-S. Yang, Y. Zhuang, Towards enhancement ...
  • I.B. Saida, K. Nadjet, B. Omar, A new algorithm for ...
  • N. Singh, D. Singh, The improved K-Means with particle swarn ...
  • X. Yang, P. Liu, Tayloring fuzzy C-Means clustering for big ...
  • B. Auffarth, Clustering by a genetic algorithm with biased mutation ...
  • Y. Zheng, Y. Zhou, J. Qu, An improved PSO clustering ...
  • A. Abraham, H. Guo, H. Liu, Swarm intelligence: foundations, perspectives ...
  • E. Bonabeau, C. Meyer, Swarm intelligence: a whole new way ...
  • _ Martens, B _ aesens, T .Fawcett, Editorial survey: swarn ...
  • A. Forestiero, C. Pizzuti, G. Spezzano, _ single pass algorithm ...
  • J. Kennedy, R. Eberhart, Particle sWarn optimization, in : Proceedings ...
  • R. Poli, J. Kennedy, _ Blackwell, Particle swarn optimization, Swarm ...
  • Rashedi, E., Nezama badi-pour, H., Saryazdi, S.: GSA: A Gravitational ...
  • G. R. Chen, J. H. Li, The dynamics analysis, control ...
  • نمایش کامل مراجع