初始化
聚类分析
计算机科学
算法
k-中心点
极小极大
k均值聚类
星团(航天器)
数学
数学优化
人工智能
CURE数据聚类算法
相关聚类
程序设计语言
作者
Xiaoyan Wang,Yanping Bai
出处
期刊:SpringerPlus
[Springer International Publishing]
日期:2016-09-27
卷期号:5 (1): 1665-1665
被引量:62
标识
DOI:10.1186/s40064-016-3329-4
摘要
The global k -means algorithm is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure from suitable initial positions, and employs k -means to minimize the sum of the intra-cluster variances. However the global k -means algorithm sometimes results singleton clusters and the initial positions sometimes are bad, after a bad initialization, poor local optimal can be easily obtained by k -means algorithm. In this paper, we modified the global k -means algorithm to eliminate the singleton clusters at first, and then we apply MinMax k -means clustering error method to global k -means algorithm to overcome the effect of bad initialization, proposed the global Minmax k -means algorithm. The proposed clustering method is tested on some popular data sets and compared to the k -means algorithm, the global k -means algorithm and the MinMax k -means algorithm. The experiment results show our proposed algorithm outperforms other algorithms mentioned in the paper.
科研通智能强力驱动
Strongly Powered by AbleSci AI