Skip to main content

Model Trees

  • Reference work entry
  • First Online:
Encyclopedia of Machine Learning and Data Mining
  • 64 Accesses

Synonyms

Functional trees, Linear regression trees, Piecewise linear models

Definition

Model trees are supervised learning methods that obtain a type of tree-based regression model, similar to regression trees, with the particularity of having functional models in the leaves instead of constants. These methods address multiple regression problems. In these problems we are usually given a training sample of n observations of a target continuous variable Y and of a vector of p predictor variables, \(\mathbf{x} = X_{1},\cdots \,,X_{p}\). Model trees provide an approximation of an unknown regression function Y = f(x) +ɛ with \(Y \in \mathfrak{R}\) and \(\varepsilon \approx N(0,\sigma ^{2})\). The leaves of these trees usually contain linear regression models, although some works also consider other types of models.

Motivation and Background

Model trees are motivated by the purpose of overcoming some of the known limitations of regression trees caused by their piecewise constant...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 699.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  • Breiman L, Meisel WS (1976) General estimates of the intrinsic variability of data in nonlinear regression models. J Am Stat Assoc 71:301–307

    Article  MATH  Google Scholar 

  • Chaudhuri P, Huang M, Loh W, Yao R (1994) Piecewise-polynomial regression trees. Stat Sin 4:143–167

    MATH  Google Scholar 

  • Dobra A, Gehrke JE (2002) Secret: a scalable linear regression tree algorithm. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, Edmonton

    Google Scholar 

  • Friedman J (1979) A tree-structured approach to nonparametric multiple regression. In: Gasser T, Rosenblatt M (eds) Smoothing techniques for curve estimation. Lecture notes in mathematics, vol 757. Springer, Berlin/New York, pp 5–22

    Chapter  Google Scholar 

  • Karalic A (1992) Employing linear regression in regression tree leaves. In Proceedings of ECAI-92, Vienna. Wiley & Sons

    Google Scholar 

  • Loh W (2002) Regression trees with unbiased variable selection and interaction detection. Stat Sin 12:361–386

    MathSciNet  MATH  Google Scholar 

  • Malerba D, Appice A, Ceci M, Monopoli M (2002) Trading-off local versus global effects of regression nodes in model trees. In: ISMIS’02: proceedings of the 13th international symposium on foundations of intelligent systems, Lyon. Springer, pp 393–402

    Chapter  Google Scholar 

  • Malerba D, Esposito F, Ceci M, Appice A (2004) Top-down induction of model trees with regression and splitting nodes. IEEE Trans Pattern Anal Mach Intell 26(5):612–625

    Article  Google Scholar 

  • Natarajan R, Pednault E (2002) Segmented regression estimators for massive data sets. In: Proceedings of the second SIAM international conference on data mining (SDM’02), Arlington

    Google Scholar 

  • Potts D, Sammut C (2005) Incremental learning of linear model trees. Mach Learn 61(1–3):5–48

    Article  MATH  Google Scholar 

  • Quinlan J (1992) Learning with continuous classes. In: Adams, Sterling (eds) Proceedings of AI’92, Hobart. World Scientific, pp 343–348

    Google Scholar 

  • Torgo L (1997) Functional models for regression tree leaves. In: Fisher D (ed) Proceedings of the 14th international conference on machine learning, Nashville. Morgan Kaufmann Publishers

    Google Scholar 

  • Torgo L (1999) Inductive learning of tree-based regression models. Ph.D. thesis, Faculty of Sciences, University of Porto

    Google Scholar 

  • Torgo L (2000) Partial linear trees. In: Langley P (ed) Proceedings of the 17th International Conference on Machine Learning (ICML 2000), Stanford. Morgan Kaufmann Publishers, pp 1007–1014

    Google Scholar 

  • Torgo L (2002) Computationally efficient linear regression trees. In: Jajuga K, Sokolowski A, Bock H (eds) Classification, clustering and data analysis: recent advances and applications (Proceedings of IFCS 2002). Studies in classification, data analysis, and knowledge organization. Springer, Berlin/New York, pp 409–415

    Google Scholar 

  • Vogel D, Asparouhov O, Scheffer T (2007) Scalable look-ahead linear regression trees. In: KDD’07: proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, San Jose. ACM, pp 757–764

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Luı́s Torgo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media New York

About this entry

Cite this entry

Torgo, L. (2017). Model Trees. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_558

Download citation

Publish with us

Policies and ethics