Scholarlink

<p>In this paper, we propose a centroid-based algorithm for problems with capacity constraints. These constraints involve weights associated with the data points and capacities for the clusters, such that the sum of the weights of the points in each cluster must equal its capacity. This generalizes the problem with size constraints where the number of points in each cluster is specified by the user. Through numerical experiments, we demonstrate that our approach is competitive in terms of clustering quality while requiring minimal computational time.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An approach to the clustering problem with capacity constraints

  • 期刊论文

  • 发表日期：

    2025年10月15日

查看全文
  • Kléber A. Benatti,
  • João V. Pamplona,
  • Lucas G. Pedroso,
  • Ademir A. Ribeiro

摘要

In this paper, we propose a centroid-based algorithm for problems with capacity constraints. These constraints involve weights associated with the data points and capacities for the clusters, such that the sum of the weights of the points in each cluster must equal its capacity. This generalizes the problem with size constraints where the number of points in each cluster is specified by the user. Through numerical experiments, we demonstrate that our approach is competitive in terms of clustering quality while requiring minimal computational time.