K-means Algorithm for Optimizing Initial Clustering Center Based on Density Peak

The K-means is sensitive to the initial choice of cluster centers, leading to the results to be different every time. To address this, a new K-means variant based on decision values is introduced. This approach incorporates the nearest neighbor concept when calculating decision values to ensure density correlation and improve clustering stability. Additionally, a revised method for local density calculation is proposed. With the predefined number of clusters, data points with higher decision values are automatically selected as centers, and the median of points in each cluster replaces the mean to reduce the influence of outliers. Experimental results show that this decision-based K-means algorithm (DPK) achieves stable performance, requires fewer iterations, demonstrates robust handling of outliers, and offers improved clustering accuracy.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/itcem65710.2024.00025
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

K-means Algorithm for Optimizing Initial Clustering Center Based on Density Peak

Xiaofang Zhong, Jiyong Liao, Xinyi Qing, Yimei Yang
Advanced Clustering Algorithms Research
article

K-means Algorithm for Optimizing Initial Clustering Center Based on Density Peak

Xiaofang Zhong, Jiyong Liao, Xinyi Qing, Yimei Yang
article en

Abstract

The K-means is sensitive to the initial choice of cluster centers, leading to the results to be different every time. To address this, a new K-means variant based on decision values is introduced. This approach incorporates the nearest neighbor concept when calculating decision values to ensure density correlation and improve clustering stability. Additionally, a revised method for local density calculation is proposed. With the predefined number of clusters, data points with higher decision values are automatically selected as centers, and the median of points in each cluster replaces the mean to reduce the influence of outliers. Experimental results show that this decision-based K-means algorithm (DPK) achieves stable performance, requires fewer iterations, demonstrates robust handling of outliers, and offers improved clustering accuracy.

Huaihua University (CN)
Openalex Percentile: Top 74%
Advanced Clustering Algorithms Research
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.

K-means Algorithm for Optimizing Initial Clustering Center Based on Density Peak — Xiaofang Zhong, Jiyong Liao, et al. · (2024) | TGRS Research Map | TGRS