A scalable algorithm for rule post-pruning of large decision trees

DOI10.1007/3-540-45357-1_49MaRDI QIDQ2768931zbMATH OpenFDO

Authors Trong Dung Nguyen, Tu Bao Ho, Hiroshi Shomodaira

Publication date 10 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45357-1_49

zbMATH Keywords

data miningdecision tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 67806
• Learning and applications based on rough set theory
• The effects of pruning methods on the predictive accuracy of induced decision trees
• Induction of classification rules by Gini-index based rule generation
• scientific article; zbMATH DE number 2032414

Cited in

(5)

• A combined optimization decision tree algorithm suitable for large scale data-base
• Evaluating Learning Algorithms Composed by a Constructive Meta-learning Scheme for a Rule Evaluation Support Method
• scientific article; zbMATH DE number 67806 (Why is no real title available?)
• scientific article; zbMATH DE number 1168532 (Why is no real title available?)
• Efficient learning of large sets of locally optimal classification rules

Describes a project that uses

Uses Software

• C4.5

This page was built for publication: A scalable algorithm for rule post-pruning of large decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768931)