.png){kind=icon}
返回
Clustering by competitive agglomeration
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(96)00140-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new clustering algorithm called Competitive Agglomeration (CA), which minimizes an objective function that incorporates the advantages of both hierarchical and partitional clustering. The CA algorithm produces a sequence of partitions with a decreasing number of clusters. The initial partition has an over specified number of clusters, and the final one has the ''optimal'' number of clusters. The update equation in the CA algorithm creates an environment in which clusters compete for feature points and only clusters with large cardinalities survive. The algorithm can incorporate different distance measures in the objective function to find an unknown number of clusters of various shapes. (C) 1997 Pattern Recognition Society.
Keyword:
unsupervised clustering
fuzzy clustering
competitive agglomeration
cluster validity
line detection
curve detection
plane fitting
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
.png){kind=icon}
没有更多内容