首页> 外文会议>PRICAI'98 : Topics in artificial intelligence >Concurrent Discretization of Multiple Attributes
【24h】

Concurrent Discretization of Multiple Attributes

机译:多个属性的并行离散化

获取原文
获取原文并翻译 | 示例

摘要

Better decision trees can be learnt by merging continuous values into intervals. Merging of values, however, could introduce inconsistencies to the data, or information loss. When it is desired to maintain a certain consistency, interval mergings in one attribute could disable those in another attribute. This interaction raises the issue of determining the order of mergings. We consider a globally greedy heuristic that selects the "best" merging from all continuous attributes at each step. We present an implementation of the heuristic in which the best merging is determined in a time independent of the number of possible mergings. Experiments show that intervals produced by the heuristic lead to improved decision trees.
机译:通过将连续值合并为间隔,可以学习更好的决策树。但是,值的合并可能会导致数据不一致或信息丢失。当需要保持一定的一致性时,一个属性中的间隔合并可能会禁用另一属性中的间隔合并。这种相互作用提出了确定合并顺序的问题。我们考虑一种全局贪婪启发式方法,该方法在每个步骤中从所有连续属性中选择“最佳”合并。我们提出了一种启发式的实现方式,在这种方式中,可以在不考虑可能合并次数的情况下确定最佳合并的时间。实验表明,启发式方法产生的间隔可以改善决策树。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号