Combining K-Means and Optimization Algorithms for data clustering

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

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

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

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

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

CITCOMP01_069

تاریخ نمایه سازی: 16 شهریور 1395

چکیده مقاله:

Data clustering is related to the split of a set of objects into smaller groups with common features. Several optimization techniques have been proposed to increase the performance of clustering algorithms. Swarm Intelligence algorithms are concerned with optimization problems and they have been successfully applied to different domains. In this work, a Swarm Clustering Algorithm is proposed based on the standard K-Means clustering algorithms, which are used as fitness functions for a Swarm Intelligence algorithm. The motivation is to exploit the search capability of Swarm Intelligence algorithms and to avoid the major limitation of falling into locally optimal values of the K-Means algorithm. Because of the inherent parallel nature of the Swarm Intelligence algorithms, since the fitness function can be evaluated for each individual in an isolated manner, we have developed the parallel implementation, comparing the performances with their algorithm. Experiments with 2 bench-mark datasets have shown similar or slightly better quality of the results compared to standard K-Means algorithm and other algorithm. There results of using proposed algorithm for clustering are promising

نویسندگان

Mohammad Moazeni

Department of computer Architecture, Dezful Branch , Islamic Azad university, Dezful, Iran

Karim Ansari-Asl

Department of Electrical Engineer, Shahid Chamran University, Ahvaz, Iran

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

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • A.R. Jain, M.N. Murthy, P.J. Flynn, Data clustering: a review, ...
  • S.P. Lloyd, Least squares quantization in PCM, IEEE Trans. Inf. ...
  • B. Zhang, M. Hsu, U. Dayal, K-Harmonic Means: A data ...
  • A. Hatamlou, S. Abdullah, H. Nezamab adi-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 SWarm ...
  • X. Yang, P. Liu, Tayloring fuzzy C-Means clustering for big ...
  • B. Auffarth, Clustering by a genetic algorithm with biased mutation ...
  • M. Yin, Y. Hu, F. Yang, X. Li, W. Gu, ...
  • Y. Zheng, Y. Zhou, J. Qu, An improved PSO clustering ...
  • J. Kennedy, R. Eberhart, Particle _ optimization, in: Proceedings of ...
  • Rashedi, E., Nezama badi-pour, H., Saryazdi, S.: GSA: A Gravitationl ...
  • C.L. Blake, CJ. Merz, UCI Repository of Machine Learning Database, ...
  • نمایش کامل مراجع