基于改进K-Means算法的手机处理器聚类分析
Clustering Analysis of Mobile Processor Based on Improved K-Means Algorithm
摘要:
提出了一种改进的K-means聚类算法,并对2015至2019年手机市场主流的51款处理器进行聚类分析。首先使用手肘法改进K-means算法中K值的选取,求出最佳K值;其次利用欧氏距离求得各样本到聚类中心的距离,并将各样本归类到离其最近的聚类中心所在的簇中;重新计算新簇的聚类中心,若与旧聚类中心相同,则停止运算,否则重新计算各样本到新聚类中心的距离,重新归类直至新聚类中心与旧聚类中心相同;最后得到4个簇,分别包含7、16、14、14个样本,并将其分为高端、中端、中低端、低端处理器。
Abstract:
An improved K-means clustering algorithm is proposed, and 51 mainstream processors in the mobile phone market from 2015 to 2019 are analyzed. Firstly, the elbow method is used to improve the selection of K value in k-means algorithm, and the best K value is obtained. Secondly, the Euclidean distance is used to find the distance from each sample to the cluster center, and all samples are gradually classified into the nearest cluster. Then the new cluster centers are recalculated. If the new cluster centers are the same as the old ones, the operation is stopped. Otherwise, the distance from each sample to the new cluster centers is recalculated and reclassified until the new cluster centers are the same as the old ones. Finally, four clusters are obtained, including 7, 16, 14 and 14 samples, which are divided into high-end, middle-end, middle-low-end and low-end processors according to the original data.
参考文献
|
[1]
|
董骐瑞. k-均值聚类算法的改进与实现[D]: [硕士学位论文]. 长春: 吉林大学, 2015.
|
|
[2]
|
凌静, 江凌云, 赵迎. 结合模拟退火算法的遗传K-Means聚类方法[J]. 计算机技术与发展, 2019, 29(9): 61-65.
|
|
[3]
|
黄晓辉, 王成, 熊李艳, 曾辉. 一种集成簇内和簇间距离的加权k-means聚类方法[J]. 计算机学报, 2019, 42(12): 2836-2848.
|
|
[4]
|
王巧玲, 乔非, 蒋友好. 基于聚合距离参数的改进K-means算法[J]. 计算机应用, 2019, 39(9): 2586-2590.
|
|
[5]
|
唐泽坤, 朱泽宇, 杨裔, 李彩虹, 李廉. 基于距离和密度的d-K-means算法[J]. 计算机应用研究, 2020, 37(6): 1719-1723.
|
|
[6]
|
刘越. K-means聚类算法的改进[D]: [硕士学位论文]. 桂林: 广西师范大学, 2016.
|
|
[7]
|
黄继超. k-means算法若干改进和应用[D]: [硕士学位论文]. 长沙: 中南大学, 2013.
|
|
[8]
|
何晓群. 多元统计分析[M]. 第4版. 北京: 中国人民大学出版社, 2015: 64-65.
|
|
[9]
|
吴广建, 章剑林, 袁丁. 基于K-means的手肘法自动获取K值方法研究[J]. 软件, 2019, 40(5): 167-170.
|
|
[10]
|
Liberti, L., Lavor, C., Maculan, N., et al. (2012) Euclidean Distance Geometry and Applications. Quantitative Biology, 56, 3-69. [Google Scholar] [CrossRef]
|