Decision tree induction based on efficient tree restructuring

DOI10.1023/A:1007413323501zbMath0886.68105OpenAlexW2133632100MaRDI QIDQ1373712

Jeffery A. Clouse, Neil C. Berkman, Paul E. Utgoff

Publication date: 4 May 1998

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1007413323501

zbMATH Keywords

decision treetree induction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (19)

On Tackling Explanation Redundancy in Decision Trees ⋮ A full order, reduced order and machine learning model pipeline for efficient prediction of reactive flows ⋮ Low-Rank Online Metric Learning ⋮ Online Adaptive Decision Trees ⋮ Efficient incremental planning and learning with multi-valued decision diagrams ⋮ Wrappers for feature subset selection ⋮ On computing probabilistic abductive explanations ⋮ A lossless online Bayesian classifier ⋮ Incremental learning of linear model trees ⋮ An incremental learning algorithm based on the \( K\)-associated graph for non-stationary data classification ⋮ Reformulation of the support set selection problem in the logical analysis of data ⋮ Incremental learning of linear model trees ⋮ FE-CIDIM: fast ensemble of CIDIM classifiers ⋮ Modular learning models in forecasting natural phenomena. ⋮ A methodology for dynamic data mining based on fuzzy clustering ⋮ Reusable components in decision tree induction algorithms ⋮ Online Adaptive Decision Trees: Pattern Classification and Function Approximation ⋮ Introducing IVSA: A new concept learning algorithm ⋮ Incremental learning with partial instance memory

This page was built for publication: Decision tree induction based on efficient tree restructuring