Density peaks clustering based on geodetic distance and dynamic neighbourhood
by Li Lv; Jiayuan Wang; Runxiu Wu; Hui Wang; Ivan Lee
International Journal of Bio-Inspired Computation (IJBIC), Vol. 17, No. 1, 2021

Abstract: Density peaks clustering algorithm uses Euclidean distance as a measure of similarity between the samples and it can achieve a good clustering effect when processing the manifold datasets. Utilising this feature, we propose a density peaks clustering algorithm based on geodetic distance and dynamic neighbourhood. This new algorithm measures the similarity between the samples by using geodetic distance, and the number of neighbours K is dynamically adjusted according to the spatial distribution of samples for geodetic distance computation. By choosing geodetic distance as the similarity measure, the problems of manifold dataset clustering can be easily solved, and the clustering is made more effective when the sparse clusters and dense clusters co-exist. The new algorithm was then compared against the other five clustering algorithms on six synthetic datasets and ten real-world datasets. The experiments showed that the proposed algorithm not only outperformed the other conventional algorithms on manifold datasets, but also achieved a very good clustering effect on multi-scale, cluttered and intertwined datasets.

Online publication date: Mon, 01-Mar-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
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 Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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