title: Online adaptive decision trees: pattern classification and function approximation.
abstract: Recently we have shown that decision trees can be trained in the online adaptive (OADT) mode (Basak, 2004), leading to better generalization score. OADTs were bottlenecked by the fact that they are able to handle only two-class classification tasks with a given structure. In this article, we provide an architecture based on OADT, ExOADT, which can handle multiclass classification tasks and is able to perform function approximation. ExOADT is structurally similar to OADT extended with a regression layer. We also show that ExOADT is capable not only of adapting the local decision hyperplanes in the nonterminal nodes but also has the potential of smoothly changing the structure of the tree depending on the data samples. We provide the learning rules based on steepest gradient descent for the new model ExOADT. Experimentally we demonstrate the effectiveness of ExOADT in the pattern classification and function approximation tasks. Finally, we briefly discuss the relationship of ExOADT with other classification models.
authors.affiliation: IBM India Research Lab, Indian Institute of Technology, New Delhi 110016, India. basakjayanta@yahoo.com
authors.forename: Jayanta
authors.initials: J
authors.lastname: Basak
mesh_terms: D003663:Decision Trees; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000145:classification*