Improved density peaks clustering based on firefly algorithm Online publication date: Mon, 16-Mar-2020
by Jia Zhao; Jingjing Tang; Aiye Shi; Tanghuai Fan; Lizhong Xu
International Journal of Bio-Inspired Computation (IJBIC), Vol. 15, No. 1, 2020
Abstract: The cut-off distance of the density peaks clustering (DPC) algorithm need to be set manually; the two local densities of the algorithm have a large difference in the clustering effect on the same dataset. To address the issue, the paper proposes an improved DPC based on firefly algorithm. It combines the cut-off kernel and the Gaussian kernel defined by the DPC algorithm, and balances the effects of the two kernels by the weighting factor. Meanwhile, a cluster-like centre evaluation criterion based on local density and relative distance of preference coefficient is constructed. In order to determine the parameters of the cut-off distance, weighting factor and preference coefficient, the three parameters are optimised by the firefly algorithm with the Rand index as the objective function. The experiment results show that the performance of the proposed method on synthetic datasets and real datasets is better than DPC and its variants.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Bio-Inspired Computation (IJBIC):
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook