【24h】

A Tabu Search Based Algorithm for Clustering Categorical Data Sets

机译:基于禁忌搜索的分类数据集聚类算法

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

摘要

Clustering methods partition a set of objects into clusters such that objects in the same cluster are more similar to each other than objects in different clusters according to some defined criteria. In this paper, we present an algorithm, called tabu search fuzzy κ-modes, to extend the fuzzy κ-means paradigm to categorical domains. Using the tabu search based technique, our algorithm can explore the solution space beyond local optimality in order to aim at finding a global optimal solution of the fuzzy clustering problem. It is found that our algorithm performs better, in terms of accuracy, than the fuzzy κ-modes algorithm.
机译:聚类方法将一组对象划分为多个聚类,以便根据某些定义的标准,同一聚类中的对象比不同聚类中的对象彼此更相似。在本文中,我们提出了一种称为禁忌搜索模糊κ模式的算法,用于将模糊κ均值范式扩展到分类域。使用基于禁忌搜索的技术,我们的算法可以探索局部最优之外的解空间,以寻找模糊聚类问题的全局最优解。发现我们的算法在准确性方面比模糊κ模式算法更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号