首页> 外文会议>Annual genetic and evolutionary computation conference;GECCO-2010 >Pruning Association Rules using Statistics and Genetic Relation Algorithmc
【24h】

Pruning Association Rules using Statistics and Genetic Relation Algorithmc

机译:使用统计和遗传关系算法修剪关联规则

获取原文

摘要

Most of the classification methods proposed produces too many rules for humans to read over, that is, the number of generated rules is thousands or millions which means complex and hardly understandable for the users.In this paper, a new post-processing pruning method for class association rules is proposed by a combination of statistics and an evolutionary method named Genetic Relation Algorithm (GRA). The algorithm is carried out in two phases. In the first phase the rules are pruned depending on their matching degree and in the second phase GRA selects the most interesting rules using the distance between them and their strength.
机译:提出的大多数分类方法产生了太多规则供人类阅读,也就是说,生成的规则数量为数千或数百万,这意味着复杂且用户难以理解。 本文提出了一种新的分类关联规则的后处理修剪方法,该方法是将统计数据和一种称为遗传关系算法(GRA)的进化方法相结合。该算法分两个阶段执行。在第一阶段,根据规则的匹配程度对规则进行修剪,而在第二阶段,GRA使用规则之间的距离和强度来选择最有趣的规则。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号