Evolutionary K-means Clustering Algorithm
Publish Year: 1395
نوع سند: مقاله کنفرانسی
زبان: English
View: 363
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICEEE08_235
تاریخ نمایه سازی: 11 مرداد 1396
Abstract:
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.
Keywords:
Authors
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
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :