CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

An Efficient K-Means Clustering Algorithm

عنوان مقاله: An Efficient K-Means Clustering Algorithm
شناسه ملی مقاله: ISCEE10_214
منتشر شده در دهمین کنفرانس دانشجویی مهندسی برق ایران در سال 1386
مشخصات نویسندگان مقاله:

Zahra Zamani - Department of Electrical and Computer engineeringIsfahan University of technology, Isfahan, ۸۴۱۵۶-۸۳۱۱۱
Neda Salehi

خلاصه مقاله:
In this paper, we present a clustering algorithm called K-means. Clustering has many different algorithms and these algorithms are used in different scientific aspects. After a short explanation about clustering way and it's algorithms and their application we explain about this algorithm and how to do it's process. Then we explain it's problems and tried to present a new algorithm to cope with some of the Kmeans algorithm problems. This new algorithm works based on a statistical way. This algorithm has higher performance for larger databases rather than K-means algorithm and solve some of the K-means algorithm problems.

کلمات کلیدی:
Data mining , clustering , K-means algorithm

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/127581/