Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm

سال انتشار: 1394
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 328

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

این مقاله در بخشهای موضوعی زیر دسته بندی شده است:

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

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

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

JR_JCR-7-1_006

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

چکیده مقاله:

Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K-Means, which alters the convergence method of K-Means algorithm to provide more accurate clustering results than the K-means algorithm and its variants by increasing the clusters’ coherence. Persistent K-Means uses an iterative approach to discover the best result for consecutive iterations of KMeans algorithm.

کلیدواژه ها:

نویسندگان

Rasool Azimi

Faculty of Computer and Information Technology Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

Hedieh Sajedi

Department of Computer Science, College of Science, University of Tehran, Tehran, Iran