Clustering with Intelligent Linexk-Means

نویسندگان

  • A. Mohammadpour Department of Statistics, Faculty of Mathematics & Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran.
  • M.H. Behzadi Department of Statistics, Science and Research Branch, Islamic Azad University, Tehran, Iran
  • N Ahmadzadehgolia Department of Statistics, Science and Research Branch, Islamic Azad University, Tehran, Iran
چکیده مقاله:

The intelligent LINEX k-means clustering is a generalization of the k-means clustering so that the number of clusters and their related centroid can be determined while the LINEX loss function is considered as the dissimilarity measure. Therefore, the selection of the centers in each cluster is not randomly. Choosing the LINEX dissimilarity measure helps the researcher to overestimate or underestimate the centers which helps to assign some entities into a special cluster. We check the performance of the algorithm on some real and artificial datasets and evaluate the results according to some internal and external indexes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RK-Means Clustering: K-Means with Reliability

This paper presents an RK-means clustering algorithm which is developed for reliable data grouping by introducing a new reliability evaluation to the K-means clustering algorithm. The conventional K-means clustering algorithm has two shortfalls: 1) the clustering result will become unreliable if the assumed number of the clusters is incorrect; 2) during the update of a cluster center, all the d...

متن کامل

Bilateral Weighted Fuzzy C-Means Clustering

Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...

متن کامل

Constrained clustering with k-means

We introduce a k−means type clustering in the presence of cannot–link and must–link constraints. First we apply a BIRCH type methodology to eliminate must–link constraints. Next we introduce a penalty function to substitute cannot–link constraints. When penalty values increase to +∞ the original cannot–link constraints are recovered. The preliminary numerical experiments show that constraints h...

متن کامل

Enhanced Clustering Based on K-means Clustering Algorithm and Proposed Genetic Algorithm with K-means Clustering

-In this paper targeted a variety of techniques, tactics and distinctive areas of the studies that are useful and marked because the crucial discipline of information mining technologies. The overall purpose of the system of statistics mining is to extract beneficial facts from a large set of information and changing it right into a shape that is comprehensible for in addition use. Clustering i...

متن کامل

Improving K-means clustering algorithm with the intelligent water drops (IWD) algorithm

In this paper, the K-means algorithm for data clustering is improved by the swarm-based nature-inspired optimisation algorithm, the intelligent water drops (IWD) algorithm. The K-means algorithm is an iterative algorithm in which the number of clusters is given in advance. Although the K-means is fast to converge, it is sensitive to the initial conditions. As a result, it is often trapped in lo...

متن کامل

OPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM

This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 4  شماره شماره 2 (پیاپی 14)

صفحات  5- 14

تاریخ انتشار 2018-07-23

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023