首页> 外文会议>Principles and practice of constraint programming >Constrained Minimum Sum of Squares Clustering by Constraint Programming
【24h】

Constrained Minimum Sum of Squares Clustering by Constraint Programming

机译:约束规划约束最小平方和

获取原文
获取原文并翻译 | 示例

摘要

The Within-Cluster Sum of Squares (WCSS) is the most used criterion in cluster analysis. Optimizing this criterion is proved to be NP-Hard and has been studied by different communities. On the other hand, Constrained Clustering allowing to integrate previous user knowledge in the clustering process has received much attention this last decade. As far as we know, there is a single approach that aims at finding the optimal solution for the WCSS criterion and that integrates different kinds of user constraints. This method is based on integer linear programming and column generation. In this paper, we propose a global optimization constraint for this criterion and develop a filtering algorithm. It is integrated in our Constraint Programming general and declarative framework for Constrained Clustering. Experiments on classic datasets show that our approach outperforms the exact approach based on integer linear programming and column generation.
机译:群集内平方和(WCSS)是群集分析中最常用的标准。优化此标准被证明是NP-Hard,并且已由不同社区进行了研究。另一方面,在过去的十年中,允许在聚类过程中集成以前的用户知识的约束聚类得到了极大的关注。据我们所知,只有一种方法旨在为WCSS标准找到最佳解决方案,并且集成了各种用户约束。该方法基于整数线性编程和列生成。在本文中,我们针对此准则提出了全局优化约束,并开发了一种过滤算法。它被集成到我们的约束聚类的约束编程通用和声明性框架中。在经典数据集上进行的实验表明,我们的方法优于基于整数线性规划和列生成的精确方法。

著录项

  • 来源
  • 会议地点 Cork(IE)
  • 作者单位

    University of Orleans, INSA Centre Val de Loire LIFO EA 4022, F-45067 Orleans, France;

    University of Orleans, INSA Centre Val de Loire LIFO EA 4022, F-45067 Orleans, France;

    University of Orleans, INSA Centre Val de Loire LIFO EA 4022, F-45067 Orleans, France;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号