%0 Journal Article
%T 基于空间平移的K-Means初始簇心选取<br>K-Means Initial Cluster Center Selection Based on Spatial Translation
%A 朱家乐
%J Advances in Applied Mathematics
%P 4381-4390
%@ 2324-8009
%D 2024
%I Hans Publishing
%R 10.12677/aam.2024.139418
%X K-means聚类算法因其算法简单、计算效率高&#65292;在机器学习、数据挖掘等多个领域得到了广泛应用。然而&#65292;传统K-means算法在初始簇心的选取上存在随机性&#65292;这可能导致聚类结果的不稳定性。为了解决这一问题&#65292;本研究提出了一种基于空间平移的初始簇心选取算法。该算法首先将包含所有样本集的最小空间通过单位空间以一定步长遍历&#65292;在单位空间内统计样本点的密度&#65292;以此降低计算量。通过逐一选出密度最高的个点作为初始簇心&#65292;从而提高了K-means算法的聚类性能。在UCI的12种数据集上进行的实验表明&#65292;与传统的K-means、K-means++等算法相比&#65292;改进的算法在迭代次数上有所降低&#65292;聚类准确率得到了显著提高。<br>K-means clustering algorithm is an important content in the field of machine learning and is widely used because of its simplicity and efficiency. In order to solve the problem that the initial cluster center selection of traditional K-means algorithm is random, an initial cluster center selection algorithm based on space segmentation is proposed. The minimum space containing all sample sets is divided to calculate the density, and the initial cluster centers with the highest density are selected one by one. The selected cluster centers are replaced by random initial cluster centers for K-means clustering. Twelve datasets were tested separately at UCI. The experimental results show that compared with traditional K-means, K-means++ and other algorithms, the improved algorithm has lower iteration times and higher clustering accuracy.
%K K-Means&#65292
%K 初始聚类中心&#65292
%K 密度&#65292
%K 空间平移<br>K-Means
%K Initial Cluster Center
%K Density
%K Spatial Translation
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=96919