首页> 外文会议> >A lazy algorithm for decision tree induction based on importance of attributes
【24h】

A lazy algorithm for decision tree induction based on importance of attributes

机译:一种基于属性重要性的懒惰决策树归纳算法

获取原文

摘要

This paper applies lazy idea to fuzzy decision tree induction. A new algorithm is proposed in this paper based on important of attributes. This algorithm, which does not generate a decision tree for all training examples, only determines a specified path for each test case. Obviously the algorithm has reduced the computational effort of training but increase the complexity of testing. We experimentally find that the proposed algorithm is superior to the traditional one on robustness.
机译:本文将懒惰思想应用于模糊决策树的归纳。基于重要属性,本文提出了一种新的算法。该算法不会为所有训练示例生成决策树,只能为每个测试用例确定一条指定的路径。显然,该算法减少了训练的计算量,但增加了测试的复杂性。我们通过实验发现,该算法在鲁棒性方面优于传统算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号