The full text of this article
Performance analysis of firefly algorithm for data clustering
by Hema Banati; Monika Bajaj
International Journal of Swarm Intelligence (IJSI), Vol. 1, No. 1, 2013
Abstract: Extraction of relevant information from web is gaining immense significance. This depends upon the efficacy of methods employed to represent, organise and access the information. The most important technique that is used to organise the data is clustering. Clustering problem refers to partitioning unlabeled data objects into certain number of clusters with the objective of maximum homogeneity within cluster and heterogeneity between the clusters. The paper studies viability of firefly algorithm for clustering. It incorporates the flashing behaviour of fireflies to achieve the optimal solution. The performance of the proposed algorithm FClust is compared with particle swarm optimisation (PSO) and differential evolution (DE) algorithms with respect to varied statistical criteria using artificial and benchmark datasets. A detailed convergence behaviour of algorithms is studied using run length distribution. The experimental results prove that the proposed algorithm performs better in terms of speed and success rate as compared to PSO and DE.
Online publication date: Thu, 08-Aug-2013
is only available to individual subscribers or to users at subscribing institutions.
Go to Inderscience Online Journals to access the Full Text of this article.
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Swarm Intelligence (IJSI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable).
See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org