首页> 外文会议>The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)论文集 >Incremental Rule-extraction Algorithms Based on Variable Precision Rough Set and Search Tree
【24h】

Incremental Rule-extraction Algorithms Based on Variable Precision Rough Set and Search Tree

机译:基于可变精度粗糙集和搜索树的增量规则提取算法

获取原文

摘要

The incrementaI rule extraction is one of the main problems of KDD.In this paper,a novel rule extract algorithm-Rule Derivation Based on Variable Precision Rough Set and Search Tree(RDBVPRST) is pro-posed.It is a depth first heuristic search algorithm. Based on this algorithm,the incremental rules are extracted and a known rule set is updated by updating the rules’confidence degree.At last,some examples are given to illustrate the characteristics of this new incremental algorithm.
机译:增量规则提取是KDD的主要问题之一。本文提出了一种新的规则提取算法-基于可变精度粗糙集和搜索树的规则推导(RDBVPRST)。它是一种深度优先的启发式搜索算法。 。在此算法的基础上,提取增量规则,并通过更新规则的置信度来更新已知规则集。最后,通过实例说明了该增量算法的特点。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号