.png){kind=icon}
返回
A note on constrained k-means algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(99)00057-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes extensions to the k-means algorithm for clustering data sets. By adding suitable constraints into the mathematical program formulation, an approach is developed, which allows the use of the ii-means paradigm to efficiently cluster data sets with the fixed number of objects in each cluster. The new algorithm is presented and the effectiveness of the algorithm is demonstrated with experimental results. (C) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keyword:
clustering
constraints
k-means algorithm
PCB insertion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容