首页> 美国卫生研究院文献>Computational Intelligence and Neuroscience >A Global-Relationship Dissimilarity Measure for the k-Modes Clustering Algorithm
【2h】

A Global-Relationship Dissimilarity Measure for the k-Modes Clustering Algorithm

机译:k模式聚类算法的全局关系差异度量

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The k-modes clustering algorithm has been widely used to cluster categorical data. In this paper, we firstly analyzed the k-modes algorithm and its dissimilarity measure. Based on this, we then proposed a novel dissimilarity measure, which is named as GRD. GRD considers not only the relationships between the object and all cluster modes but also the differences of different attributes. Finally the experiments were made on four real data sets from UCI. And the corresponding results show that GRD achieves better performance than two existing dissimilarity measures used in k-modes and Cao's algorithms.
机译:k模式聚类算法已被广泛用于聚类分类数据。在本文中,我们首先分析了k模式算法及其相异性度量。在此基础上,我们提出了一种新的差异度量,称为GRD。 GRD不仅考虑对象与所有群集模式之间的关系,还考虑不同属性的差异。最后,对UCI的四个真实数据集进行了实验。相应的结果表明,与在k模式和Cao算法中使用的两个现有的相异性度量相比,GRD可获得更好的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号