Density peaks clustering algorithm based on kernel density estimation and minimum spanning tree Online publication date: Mon, 23-Jan-2023
by Tanghuai Fan; Xin Li; Jiazhen Hou; Baohong Liu; Ping Kang
International Journal of Innovative Computing and Applications (IJICA), Vol. 13, No. 5/6, 2022
Abstract: It is to be reported that a clustering algorithm that can achieve rapid searching of density peaks in 2014. Aiming at solving the shortcomings of the algorithm, this paper proposes a density peak clustering algorithm based on kernel density estimation and minimum spanning tree (MST). The proposed DPC algorithm adopts the Gaussian kernel density to estimate the local density of samples, coordinating the relationship between the part and the whole; proposing a new allocation strategy, which combines the idea of minimum spanning tree to generate a tree from the dataset according to the principle of high density and close distance. The degree of polymerisation is defined and calculated before and after disconnecting one edge of the tree, and the edge is disconnected with the larger degree of polymerisation, which until the expected number of clusters is met. The experimental results make known that the proposed algorithm has better clustering result.
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 Innovative Computing and Applications (IJICA):
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