NEMST K-means: Introducing a Center-Based Clustering Algorithm for Detecting Arbitrary Shape and Heterogeneous Clusters
سال انتشار: 1393
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 514
فایل این مقاله در 20 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJMEC-4-13_006
تاریخ نمایه سازی: 16 فروردین 1395
چکیده مقاله:
K-means is a typical clustering algorithm which is widely used for clustering datasets and is one of the simplest, non-supervised algorithms and also it doesn't need any prior knowledge about the data distribution. A key limitation of K-means is its cluster model which is based on spherical clusters that are separable in a way so that the mean value converges towards the cluster center and it is not able to detect arbitrary shape andheterogeneous clusters. In this paper we introduce Normalized Euclidean Distanceminimum spanning tree based K-means (NEMST K-means) which is a center-basedpartitioning algorithm that uses minimum spanning tree and introduces new membership and objective functions. NEMST K-means algorithm is applied to several well-known datasets. Experimental results show that it is able to detect arbitrary shape and heterogeneous clusters and can obtain better clustering results than K-means.
کلیدواژه ها:
نویسندگان
Arash Ghorbannia Delavar
Department of Computer Science, Payame Noor University, PO BOX 19395-3697, Tehran, Iran
Gholam Hasan Mohebpour
Department of Computer Science, Payame Noor University, PO BOX 19395-3697, Tehran, Iran
Mohammad Madadpour Inallou
Young Researchers and Elites Club, West Tehran Branch, Islamic Azad University, Tehran, Iran