Article: Density peaks clustering algorithm based on kernel density estimation and minimum spanning tree Journal: International Journal of Innovative Computing and Applications (IJICA) 2022 Vol.13 No.5/6 pp.336 - 350 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. Inderscience Publishers - linking academia, business and industry through research

Title: Density peaks clustering algorithm based on kernel density estimation and minimum spanning tree

Authors: Tanghuai Fan; Xin Li; Jiazhen Hou; Baohong Liu; Ping Kang

Addresses: School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, China ' School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, China ' School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, China ' School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, China ' School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, China

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.

Keywords: density peak clustering algorithm; minimum spanning tree; MST; local density; degree of polymerisation.

DOI: 10.1504/IJICA.2022.128441

International Journal of Innovative Computing and Applications, 2022 Vol.13 No.5/6, pp.336 - 350

Received: 10 Sep 2020
Accepted: 16 Mar 2021
Published online: 23 Jan 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Density peaks clustering algorithm based on kernel density estimation and minimum spanning tree

Keep up-to-date