.png){kind=icon}
返回
Adaptive Initialization Method for K-Means Algorithm
.png){kind=icon}
OA
AI
DOI：10.3389/frai.2021.740817.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The K-means algorithm is a widely used clustering algorithm that offers simplicity and efficiency. However, the traditional K-means algorithm uses a random method to determine the initial cluster centers, which make clustering results prone to local optima and then result in worse clustering performance. In this research, we propose an adaptive initialization method for the K-means algorithm (AIMK) which can adapt to the various characteristics in different datasets and obtain better clustering performance with stable results. For larger or higher-dimensional datasets, we even leverage random sampling in AIMK (name as AIMK-RS) to reduce the time complexity. 22 real-world datasets were applied for performance comparisons. The experimental results show AIMK and AIMK-RS outperform the current initialization methods and several well-known clustering algorithms. Specifically, AIMK-RS can significantly reduce the time complexity to O (n). Moreover, we exploit AIMK to initialize K-medoids and spectral clustering, and better performance is also explored. The above results demonstrate superior performance and good scalability by AIMK or AIMK-RS. In the future, we would like to apply AIMK to more partition-based clustering algorithms to solve real-life practical problems.
Keyword:
k-means
adaptive
initialization method
initial cluster centers
clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
4.7
论文数:
2.5K
被引数:
4.4K
机构
引用论文
Graph K-means Based on Leader Identification, Dynamic Game, and Opinion Dynamics基于领导者识别、动态博弈和意见动态的k-means图
PREAI
分享收藏A new initialization and performance measure for the rough k-means clustering.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏Fabrication and characterization of silver core and porous silica shell nanocomposite particles
PREAI
分享收藏
查看更多内容