scispace - formally typeset
Journal ArticleDOI

A Comparison Study of Validity Indices on Swarm-Intelligence-Based Clustering

Reads0
Chats0
TLDR
This work compares the performances of eight well-known and widely used clustering validity indices and finds that the silhouette statistic index stands out in most of the data sets that are examined.
Abstract
Swarm intelligence has emerged as a worthwhile class of clustering methods due to its convenient implementation, parallel capability, ability to avoid local minima, and other advantages. In such applications, clustering validity indices usually operate as fitness functions to evaluate the qualities of the obtained clusters. However, as the validity indices are usually data dependent and are designed to address certain types of data, the selection of different indices as the fitness functions may critically affect cluster quality. Here, we compare the performances of eight well-known and widely used clustering validity indices, namely, the Calinski-Harabasz index, the CS index, the Davies-Bouldin index, the Dunn index with two of its generalized versions, the I index, and the silhouette statistic index, on both synthetic and real data sets in the framework of differential-evolution-particle-swarm-optimization (DEPSO)-based clustering. DEPSO is a hybrid evolutionary algorithm of the stochastic optimization approach (differential evolution) and the swarm intelligence method (particle swarm optimization) that further increases the search capability and achieves higher flexibility in exploring the problem space. According to the experimental results, we find that the silhouette statistic index stands out in most of the data sets that we examined. Meanwhile, we suggest that users reach their conclusions not just based on only one index, but after considering the results of several indices to achieve reliable clustering structures.

read more

Citations
More filters
Journal ArticleDOI

A Comprehensive Survey of Clustering Algorithms

TL;DR: This review paper begins at the definition of clustering, takes the basic elements involved in the clustering process, such as the distance or similarity measurement and evaluation indicators, into consideration, and analyzes the clustered algorithms from two perspectives, the traditional ones and the modern ones.
Journal ArticleDOI

A survey on nature inspired metaheuristic algorithms for partitional clustering

TL;DR: An up-to-date review of all major nature inspired metaheuristic algorithms employed till date for partitional clustering and key issues involved during formulation of various metaheuristics as a clustering problem and major application areas are discussed.
Journal ArticleDOI

Simulation and Hardware Implementation of New Maximum Power Point Tracking Technique for Partially Shaded PV System Using Hybrid DEPSO Method

TL;DR: In this article, a hybrid evolutionary algorithm called the DEPSO technique, a combination of the differential evolutionary (DE) algorithm and particle swarm optimization (PSO), was employed to detect the maximum power point under partial shading conditions.
Journal ArticleDOI

Dynamic clustering with improved binary artificial bee colony algorithm

TL;DR: The obtained results indicate that the discrete artificial bee colony with the enhanced solution generator component is able to reach more valuable solutions than the other algorithms in dynamic clustering, which is strongly accepted as one of the most difficult NP-hard problem by researchers.
References
More filters

Some methods for classification and analysis of multivariate observations

TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.
Journal ArticleDOI

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
Journal ArticleDOI

Finding Groups in Data: An Introduction to Chster Analysis

TL;DR: This book make understandable the cluster analysis is based notion of starsmodern treatment, which efficiently finds accurate clusters in data and discusses various types of study the user set explicitly but also proposes another.
Journal ArticleDOI

A Cluster Separation Measure

TL;DR: A measure is presented which indicates the similarity of clusters which are assumed to have a data density which is a decreasing function of distance from a vector characteristic of the cluster which can be used to infer the appropriateness of data partitions.