首页> 外文会议>ICONIP 2013 >An Efficient Clustering Method for Massive Dataset Based on DC Programming and DCA Approach
【24h】

An Efficient Clustering Method for Massive Dataset Based on DC Programming and DCA Approach

机译:基于DC编程和DCA方法的大规模数据集有效聚类方法

获取原文

摘要

In this paper, we study an efficient nonconvex optimization method for clustering on massive datasets. Our approach consists of two phases and is based on DC (Difference of Convex functions) programming and DCA (DC Algorithms). In the first phase, the data is divided into subsets on which an efficient DCA for clustering is investigated. In the second phase, another DCA for weighted clustering on the set of centers obtained by phase 1 is presented. The numerical results on real datasets show the efficiency of our method.
机译:在本文中,我们研究了在大规模数据集中聚类的高效非耦合优化方法。我们的方法由两个阶段组成,基于DC(凸函数)编程和DCA(DC算法)。在第一阶段中,将数据分为亚群,研究了用于聚类的有效DCA。在第二阶段,介绍了通过阶段1获得的集合上的另一个DCA。实时数据集的数值结果显示了我们方法的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号