首页> 外文期刊>International Journal of Business Intelligence and Data Mining >Improved Search Strategies And Extensions To K-medoids-based Clustering Algorithms
【24h】

Improved Search Strategies And Extensions To K-medoids-based Clustering Algorithms

机译:改进的搜索策略和对基于K-medoids的聚类算法的扩展

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

摘要

In this paper two categories of improvements are suggested that can be applied to most k-medoids-based algorithms - conceptual/algorithmic improvements, and implementational improvements. These include the revisiting of the accepted cases for swap comparison and the application of partial distance searching and previous medoid indexing to clustering. Various hybrids are then applied to a number of k-medoids-based algorithms and the method is shown to be generally applicable. Experimental results on both artificial and real datasets demonstrate that when applied to CLARANS the number of distance calculations can be reduced by up to 98%.
机译:在本文中,提出了两类可应用于大多数基于k-medoids的算法的改进-概念/算法改进和实现改进。这些措施包括对交换比较所接受的案例进行重新审查,以及将部分距离搜索和先前的medoid索引应用于聚类。然后,将各种混合方法应用于许多基于k-medoids的算法,并且该方法显示为普遍适用。在人工和真实数据集上的实验结果表明,将其应用于CLARANS可以将距离计算的数量最多减少98%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号