.png){kind=icon}
返回
Decision tree induction based on efficient tree restructuring
.png){kind=icon}
OA
AI
DOI：10.1023/A:1007413323501.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The ability to restructure a decision tree efficiently enables a variety of approaches to decision tree induction that would otherwise be prohibitively expensive. Two such approaches are described here, one being incremental tree induction (ITI), and the other bei ng non-incremental tree induction using a measure of tree quality instead of test quality (DMTI). These approaches and several variants offer new computational and classifier characteristics that lend themselves to particular applications.
Keyword:
decision tree
incremental induction
direct metric
binary test
example incorporation
missing value
tree transposition
installed test
virtual pruning
update cost
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
