3 research outputs found
Clustering Multidimensional Data with PSO based Algorithm
Data clustering is a recognized data analysis method in data mining whereas
K-Means is the well known partitional clustering method, possessing pleasant
features. We observed that, K-Means and other partitional clustering techniques
suffer from several limitations such as initial cluster centre selection,
preknowledge of number of clusters, dead unit problem, multiple cluster
membership and premature convergence to local optima. Several optimization
methods are proposed in the literature in order to solve clustering
limitations, but Swarm Intelligence (SI) has achieved its remarkable position
in the concerned area. Particle Swarm Optimization (PSO) is the most popular SI
technique and one of the favorite areas of researchers. In this paper, we
present a brief overview of PSO and applicability of its variants to solve
clustering challenges. Also, we propose an advanced PSO algorithm named as
Subtractive Clustering based Boundary Restricted Adaptive Particle Swarm
Optimization (SC-BR-APSO) algorithm for clustering multidimensional data. For
comparison purpose, we have studied and analyzed various algorithms such as
K-Means, PSO, K-Means-PSO, Hybrid Subtractive + PSO, BRAPSO, and proposed
algorithm on nine different datasets. The motivation behind proposing
SC-BR-APSO algorithm is to deal with multidimensional data clustering, with
minimum error rate and maximum convergence rate.Comment: 6 pages,6 figures,3 tables, conference pape
Scope of Research on Particle Swarm Optimization Based Data Clustering
Optimization is nothing but a mathematical technique which finds maxima or
minima of any function of concern in some realistic region. Different
optimization techniques are proposed which are competing for the best solution.
Particle Swarm Optimization (PSO) is a new, advanced, and most powerful
optimization methodology that performs empirically well on several optimization
problems. It is the extensively used Swarm Intelligence (SI) inspired
optimization algorithm used for finding the global optimal solution in a
multifaceted search region. Data clustering is one of the challenging real
world applications that invite the eminent research works in variety of fields.
Applicability of different PSO variants to data clustering is studied in the
literature, and the analyzed research work shows that, PSO variants give poor
results for multidimensional data. This paper describes the different
challenges associated with multidimensional data clustering and scope of
research on optimizing the clustering problems using PSO. We also propose a
strategy to use hybrid PSO variant for clustering multidimensional numerical,
text and image data.Comment: 7 pages, 6 figures, 1 table, published with International Journal of
Computer Science Trends and Technology (IJCST
A Kalman filtering induced heuristic optimization based partitional data clustering
Clustering algorithms have regained momentum with recent popularity of data
mining and knowledge discovery approaches. To obtain good clustering in
reasonable amount of time, various meta-heuristic approaches and their
hybridization, sometimes with K-Means technique, have been employed. A Kalman
Filtering based heuristic approach called Heuristic Kalman Algorithm (HKA) has
been proposed a few years ago, which may be used for optimizing an objective
function in data/feature space. In this paper at first HKA is employed in
partitional data clustering. Then an improved approach named HKA-K is proposed,
which combines the benefits of global exploration of HKA and the fast
convergence of K-Means method. Implemented and tested on several datasets from
UCI machine learning repository, the results obtained by HKA-K were compared
with other hybrid meta-heuristic clustering approaches. It is shown that HKA-K
is atleast as good as and often better than the other compared algorithms