The Density Peaks Clustering Algorithm Based on a Combination of Polynomial Kernel and EP Kernel with K-Nearest Neighbors

To address the problem of inaccurate cluster center selection in the Density Peaks Clustering (DPC) algorithm when applied to datasets with non-uniform density distributions, this paper proposes an enhanced clustering algorithm called PKEPK-DPC. The proposed method introduces a polynomial kernel-weighted distance metric, and integrates both the Exponential Power (EP) kernel function and the K-Nearest Neighbors (KNN) algorithm to construct a novel local density estimation approach. This combination effectively improves the algorithm's ability to capture similarities among high-dimensional and nonlinear data points. Experimental results on benchmark datasets demonstrate that the proposed algorithm achieves superior performance in terms of clustering accuracy and cluster center identification compared to existing methods.

Authors

Institutions

Publication Details

Published
2025-06-20
DOI
https://doi.org/10.1109/caibda65784.2025.11183045
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Density Peaks Clustering Algorithm Based on a Combination of Polynomial Kernel and EP Kernel with K-Nearest Neighbors

Wan Jing, Yu Si
Advanced Algorithms and Applications
article

The Density Peaks Clustering Algorithm Based on a Combination of Polynomial Kernel and EP Kernel with K-Nearest Neighbors

Wan Jing, Yu Si
article en

Abstract

To address the problem of inaccurate cluster center selection in the Density Peaks Clustering (DPC) algorithm when applied to datasets with non-uniform density distributions, this paper proposes an enhanced clustering algorithm called PKEPK-DPC. The proposed method introduces a polynomial kernel-weighted distance metric, and integrates both the Exponential Power (EP) kernel function and the K-Nearest Neighbors (KNN) algorithm to construct a novel local density estimation approach. This combination effectively improves the algorithm's ability to capture similarities among high-dimensional and nonlinear data points. Experimental results on benchmark datasets demonstrate that the proposed algorithm achieves superior performance in terms of clustering accuracy and cluster center identification compared to existing methods.

Harbin University of Science and Technology (CN)
Openalex Percentile: Top 65%
Advanced Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.