Skip to main content

Computationally Efficient Linear Regression Trees

  • Conference paper
Book cover Classification, Clustering, and Data Analysis

Abstract

This paper describes a method for obtaining regression trees using linear regression models in the leaves in a computationally efficient way that allows the use of this method on large data sets. This work is focused on deriving a set of formulae with the goal of allowing an efficient evaluation of all candidate tests that are considered during tree growth.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BONTEMPI, G. (2000): Local Learning Techniques for Modeling, Prediction and Control. PhD thesis, Universit Libre de Bruxelles, Belgium.

    Google Scholar 

  • BREIMAN, L., FRIEDMAN, J., OLSHEN, R. and STONE, C. (1984): Classification and Regression Trees. Statistics/Probability Series. Wadsworth Brooks/Cole Advanced Books Software.

    MATH  Google Scholar 

  • CATLETT, J. (1991): Megainduction: machine learning on very large databases. PhD thesis, Basser Department of Computer Science, University of Sydney.

    Google Scholar 

  • CLEVELAND, W.S. and LOADER, C.R. (1995): Smoothing by local regression: Principles and methods (with discussion). Computational Statistics.

    Google Scholar 

  • GOODWIN, G. and SIN, K. (1984): Adaptive Filtering Prediction and Control. Prentice-Hall.

    Google Scholar 

  • KARALIC, A. (1992): Employing linear regression in regression tree leaves. In Proceedings of ECAI-92. WileySons.

    Google Scholar 

  • MYERS, R. (1990): Classical and modern Regression with Applications 2nd edition. Duxbury Press.

    Google Scholar 

  • QUINLAN, J.R. (1992): Learning with continuous classes. In Adams Sterling, editor, Proceedings of AI’92,pages 343–348. World Scientific.

    Google Scholar 

  • TORGO, L. (1999): Inductive Learning of Tree-based Regression Models. PhD thesis, Faculty of Sciences, University of Porto.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Torgo, L. (2002). Computationally Efficient Linear Regression Trees. In: Jajuga, K., Sokołowski, A., Bock, HH. (eds) Classification, Clustering, and Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56181-8_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56181-8_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43691-1

  • Online ISBN: 978-3-642-56181-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics