文章基本信息

标题：NEMST K-means Introducing a Center-Based Clustering Algorithm for Detecting Arbitrary Shape and Heterogeneous Clusters
本地全文：下载
作者：Arash Ghorbannia Delavar ; Gholam Hasan Mohebpour ; Mohammad Madadpour Inallou 等
期刊名称：International Journal of Mechatronics, Electrical and Computer Technology
印刷版ISSN：2305-0543
出版年度：2014
卷号：4
期号：13
页码：1489-1507
出版社：Austrian E-Journals of Universal Scientific Organization
摘要：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 and heterogeneous clusters. In this paper we introduce Normalized Euclidean Distance minimum spanning tree based K-means (NEMST K-means) which is a center-based partitioning 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.
关键词：Data mining; clustering; center-based; K-means; minimum spanning tree; arbitrary cluster; heterogeneous cluster