Journal
INFORMATION PROCESSING LETTERS
Volume 116, Issue 1, Pages 1-14Publisher
ELSEVIER
DOI: 10.1016/j.ipl.2015.08.007
Keywords
Flower pollination algorithm; Randomized algorithms; Discard pollen operator; Elite based mutation operator; Crossover operator; Clustering problem
Categories
Funding
- National Science Foundation of China [61165015, 6143007, 61563008]
- Guangxi Science Foundation [2012GXNSFDA053028]
- Guangxi High School Science Foundation [20121ZD008]
Ask authors/readers for more resources
Clustering is a popular data analysis and data mining technique. The k-means clustering algorithm is one of the most commonly used methods. However, it highly depends on the initial solution and is easy to trap into the local optimal. For overcoming these disadvantages of the k-means method, Flower Pollination Algorithm with Bee Pollinator is proposed. Discard pollen operator and crossover operator are applied to increase diversity of the population, and local searching ability is enhanced by using elite based mutation operator. Ten data sets are selected to evaluate the performance of proposed algorithm. Compared with DE, CS, ABC, PSO, FPA and k-Means, the experiment results show that Flower Pollination Algorithm with Bee Pollinator has not only higher accuracy but also higher level of stability. And the faster convergence speed can also be validated by statistical results. (C) 2015 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available