.png){kind=icon}
返回
A genetic clustering algorithm using a message-based similarity measure
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.07.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a genetic clustering algorithm is described that uses a new similarity measure based message passing between data points and the candidate centers described by the chromosome. In the new algorithm, a variable-length real-value chromosome representation and a set of problem-specific evolutionary operators are used. Therefore, the proposed GA with message-based similarity (GAMS) clustering algorithm is able to automatically evolve and find the optimal number of clusters as well as proper clusters of the data set. Effectiveness of GAMS clustering algorithm is demonstrated for both artificial and real-life data set. Experiment results demonstrated that the GAMS clustering algorithm has high performance, effectiveness and flexibility. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Clustering
Evolutionary computation
Genetic algorithms
Message passing
K-means algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Origin of the anomalous 40Ar—39Ar age of Zaire cubic diamonds: excess 40Ar in pristine mantle fluids.png)
Nature
NatureIF0
PREAI
分享收藏
Solution structure of human thioredoxin in a mixed disulfide intermediate complex with its target peptide from the transcription factor NFκBStructure
OAAI
StructureIF0
OAAI分享收藏Genetic clustering for automatic evolution of clusters and application to image classificationPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容