【24h】

An Attribute Redundancy Measure for Clstering

机译:群集的属性冗余度量

获取原文

摘要

Several information theory based measures have been used in machine learning. Using the definition of the Kullback-Leibler entropy, this paper presents a new measure for clustering objects - the attribute redundancy measure. First, an introduction to clustering is made, with its interpretation from the machine learning point of view and a classification of clutering techniques poitned out. Then, a description of the use of information theory based measures in machine learning, both in supervised and in unsupervised learning is made, including the application of the mutual information. Next, the new measure is presented, highlighting its ability to capture relations between attributes and outlining its closeness to other concepts of information theory. Finally, and a genetic algorithm as the search procedure to find the best clusteirng, a comparison between the attribute redundancy measure and the mutual information is made.
机译:基于信息理论的措施已用于机器学习。使用Kullback-Leibler熵的定义,本文介绍了集群对象的新措施 - 属性冗余度量。首先,制定了对聚类的介绍,其解释了从机器学习的观点和竞争技术的分类。然后,在监督和无监督学习中,在机器学习中使用信息理论的使用的描述,包括应用相互信息的应用。接下来,提出了新的度量,突出了其捕捉属性之间关系的能力,并概述其对信息理论的其他概念的亲密关系。最后,以及作为搜索过程找到最佳CLUSTEIRNG的遗传算法,对属性冗余度量和相互信息之间的比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号