A procedure for improving generalization in classification trees

DOI10.1016/S0925-2312(01)00670-1MaRDI QIDQ1852018zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 9 January 2003

Published in Neurocomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-2312(01)00670-1

zbMATH Keywords

GeneralizationPerceptronClassification treeNeural Tree

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Improving the precision of classification trees
• Optimization of classification trees: Strategy and algorithm improvement
• A general splitting criterion for classification trees
• Improved class probability estimates from decision tree models
• A novel algorithm to optimize classification trees
• Analysis of the generalization ability of a full decision tree

Cited in

(4)

• scientific article; zbMATH DE number 5274831 (Why is no real title available?)
• Column generation based heuristic for learning classification trees
• Three Steps Strategy to Search for Optimum Classification Trees
• Inductive Logic Programming

This page was built for publication: A procedure for improving generalization in classification trees

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