Online Adaptive Decision Trees: Pattern Classification and Function Approximation

DOI10.1162/NECO.2006.18.9.2062MaRDI QIDQ5488505zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jayanta Basak

Publication date 22 September 2006

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/neco.2006.18.9.2062

zbMATH Keywords

learning rulessteepest gradient descent

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Online Adaptive Decision Trees
• scientific article; zbMATH DE number 1931832
• Optimal dyadic decision trees
• Incremental learning of linear model trees
• Incremental learning of linear model trees

Cites work

• Decision tree induction based on efficient tree restructuring
• Greedy function approximation: A gradient boosting machine.
• Hedonic housing prices and the demand for clean air
• Improved boosting algorithms using confidence-rated predictions
• Model-based classification trees
• Multivariate adaptive regression splines
• Multivariate cardinal interpolation with radial-basis functions
• On a kernel-based method for pattern recognition, regression, approximation, and operator inversion
• Online Adaptive Decision Trees
• Regularization algorithms for learning that are equivalent to multilayer networks

Cited in

(4)

• Non-stationary data sequence classification using online class priors estimation
• Online Adaptive Decision Trees
• AMF: Aggregated Mondrian Forests for Online Learning
• Online active learning of decision trees with evidential data

Describes a project that uses

Uses Software

• BNT
• SVM

This page was built for publication: Online Adaptive Decision Trees: Pattern Classification and Function Approximation

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