首页> 外文期刊>Pattern recognition letters >Deep k-Means: Jointly clustering with k-Means and learning representations
【24h】

Deep k-Means: Jointly clustering with k-Means and learning representations

机译:深度K-mease:与K均值和学习陈述共同聚类

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

摘要

We study in this paper the problem of jointly clustering and learning representations. As several previous studies have shown, learning representations that are both faithful to the data to be clustered and adapted to the clustering algorithm can lead to better clustering performance, all the more so that the two tasks are performed jointly. We propose here such an approach for k-Means clustering based on a continuous reparametrization of the objective function that leads to a truly joint solution. The behavior of our approach is illustrated on various datasets showing its efficacy in learning representations for objects while clustering them. (C) 2020 Elsevier B.V. All rights reserved.
机译:我们在本文中学研究了共同聚类和学习陈述的问题。正如以前的几项研究所示,既忠实于要聚类和适应聚类算法的数据的学习表示都可能导致群集性能更好,更重要,使得两个任务是联合执行的。我们在这里提出了基于持续重新处理的k-means聚类的方法,该函数导致真正的联合解决方案。在各种数据集上示出了我们的方法的行为,显示了在聚类时在学习物体的学习表示中的功效。 (c)2020 Elsevier B.v.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号