arrow
返回

A quality index for decision tree pruning

delete2002-01-01
delete27
delete
OA
AI
D
Dominique Fournier
B
Bruno Crémilleux
DOI:10.1016/S0950-7051(01)00119-8delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Decision tree is a divide and conquer classification method used in machine learning. Most pruning methods for decision trees minimize a classification error rate. In uncertain domains, some sub-trees that do not decrease the error rate can be relevant in pointing out some populations of specific interest or to give a representation of a large data file. A new pruning method (called DI pruning) is presented here. It takes into account the complexity of sub-trees and is able to keep sub-trees with leaves yielding to determine relevant decision rules, although they do not increase the classification efficiency. DI pruning allows to assess the quality of the data used for the knowledge discovery task. In practice, this method is implemented in the UnDeT software. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
decision tree
quality
pruning
uncertain data
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.2W
被引数:
4.5W

机构

暂无机构信息
引用论文

引用论文

Preparation, structure, surface and impedance analysis of Na2Zn0.5Mn0.5P2O7 ceramics
err2017-10-17
err0
errOAAI
errVilma Venckutė; Antonija Dindune; Dagnija Valdniece; Aija Krumina; Martynas Lelis; Vitalija Jasulaitienė; Andrius Maneikis; Saulius Daugėla; Tomas Šalkus; Algimantas Kežionis; Antanas Feliksas Orliukas
err分享
err收藏
err分享
err收藏
没有更多内容