首页> 外文期刊>Neurocomputing >A novel hybrid clustering approach based on K-harmonic means using robust design
【24h】

A novel hybrid clustering approach based on K-harmonic means using robust design

机译:基于鲁棒设计的基于K调和方法的新型混合聚类方法

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

摘要

The K-harmonic means (KHM) algorithm has been proposed for solving the initialization problem of K-means recently. However, the KHM still suffers from being trapped into local optima. In order to solve this problem, this paper presents a novel hybrid algorithm named RMSSOKHM based on KHM and a modified simplified swarm optimization. The proposed RMSSOKHM adopts the rapid centralized strategy (RCS) to increase the convergence speed and the minimum movement strategy (MMS) to effectively and efficiently search better solutions without trapping in local optima. In addition, the parameter settings of the proposed approach were optimized by using the Taguchi method. The performance of the proposed RMSSOKHM was examined and compared with the existing-known methods using eight benchmark datasets. The experimental results indicated that the proposed RMSSOKHM is superior to its competitors in terms of the quality of solutions and the efficiency of performance. (C) 2015 Elsevier B.V. All rights reserved.
机译:最近,提出了K调和平均(KHM)算法来解决K均值的初始化问题。但是,KHM仍然受困于局部最优。为了解决这个问题,本文提出了一种新的基于KHM的混合算法RMSSOKHM和改进的简化群算法。提出的RMSSOKHM采用快速集中策略(RCS)来提高收敛速度,并采用最小移动策略(MMS)来有效地搜索更好的解决方案而不会陷入局部最优。此外,通过使用Taguchi方法优化了所提出方法的参数设置。使用八个基准数据集检查了提出的RMSSOKHM的性能,并将其与现有已知方法进行了比较。实验结果表明,所提出的RMSSOKHM在解决方案质量和性能效率方面均优于其竞争对手。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号