arrow
返回

A clustering method combining differential evolution with the K-means algorithm

delete2011-09-01
delete112
PRE
AI
W
Wojciech Kwedlo *
DOI:10.1016/j.patrec.2011.05.010delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The present paper considers the problem of partitioning a dataset into a known number of clusters using the sum of squared errors criterion (SSE). A new clustering method, called DE-KM, which combines differential evolution algorithm (DE) with the well known K-means procedure is described. In the method, the K-means algorithm is used to fine-tune each candidate solution obtained by mutation and crossover operators of DE. Additionally, a reordering procedure which allows the evolutionary algorithm to tackle the redundant representation problem is proposed. The performance of the DE-KM clustering method is compared to the performance of differential evolution, global K-means method, genetic K-means algorithm and two variants of the K-means algorithm. The experimental results show that if the number of clusters K is sufficiently large, DE-KM obtains solutions with lower SSE values than the other five algorithms. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Cluster analysis
Differential evolution
K-means algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition Letters 封面图
Pattern Recognition Letters
IF:
3.3
论文数:
7.9K
被引数:
1.6W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Gencore: an efficient tool to generate consensus reads for error suppressing and duplicate removing of NGS data
err2019-12-27
err0
errOAAI
errShifu Chen; Yanqing Zhou; Yaru Chen; Tanxiao Huang; Wenting Liao; Yun Xu; Zhicheng Li; Jia Gu
err分享
err收藏
err分享
err收藏
学者 查看更多内容