NNGDPC: a kNNG-based density peaks clustering
by Miao Li
International Journal of Collaborative Intelligence (IJCI), Vol. 2, No. 1, 2019

Abstract: Density peaks clustering (DPC) algorithm is a novel clustering algorithm based on density. It needs neither iterative process nor more parameters. However, the geometry of the distribution of the data has not been taken into account in the original algorithm. DPC does not perform well when clusters have different densities. In order to overcome this problem, we propose a novel density peaks clustering based on k-nearest neighbour graph called NNGDPC (kNNG-based density peaks clustering) which introduces the idea of the nearest neighbours (k-NNG) into DPC. By experiments on synthetic datasets, we show the power of the proposed algorithm. Experimental results show that our algorithm is feasible and effective.

Online publication date: Thu, 14-Mar-2019

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 Collaborative Intelligence (IJCI):
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