.png){kind=icon}
返回
Genetic algorithm-based clustering technique
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(99)00137-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A genetic algorithm-based clustering technique, called GA-clustering, is proposed in this article. The searching capability of genetic algorithms is exploited in order to search for appropriate cluster centres in the feature space such that a similarity metric of the resulting clusters is optimized. The chromosomes, which are represented as strings of real numbers, encode the centres of a fixed number of clusters. The superiority of the GA-clustering algorithm over the commonly used K-means algorithm is extensively demonstrated for four artificial and three real-life data sets. (C) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keyword:
genetic algorithms
clustering metric
K-means algorithm
real encoding
Euclidean distance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Development of top-level requirements for regional aircraft based on the needs of the Russian market
OAAI
OAAI分享收藏
查看更多内容