You're reading from Machine Learning with R Learn techniques for building and improving machine learning models, from data preparation to model tuning, evaluation, and working with big data

Product type Paperback

Published in May 2023

Publisher Packt

ISBN-13 9781801071321

Length 762 pages

Edition 4th Edition

Languages

Tools

H2O

Concepts

Big Data

Author (1):

Brett Lantz

View More author details

Table of Contents (18) Chapters

Preface

1. Introducing Machine Learning

2. Managing and Understanding Data FREE CHAPTER

3. Lazy Learning – Classification Using Nearest Neighbors

4. Probabilistic Learning – Classification Using Naive Bayes

5. Divide and Conquer – Classification Using Decision Trees and Rules

6. Forecasting Numeric Data – Regression Methods

7. Black-Box Methods – Neural Networks and Support Vector Machines

8. Finding Patterns – Market Basket Analysis Using Association Rules

9. Finding Groups of Data – Clustering with k-means

10. Evaluating Model Performance

11. Being Successful with Machine Learning

12. Advanced Data Preparation

13. Challenging Data – Too Much, Too Little, Too Complex

14. Building Better Learners

15. Making Use of Big Data

16. Other Books You May Enjoy

17. Index

Understanding regression trees and model trees

If you recall from Chapter 5, Divide and Conquer – Classification Using Decision Trees and Rules, a decision tree builds a model, much like a flowchart, in which decision nodes, leaf nodes, and branches define a series of decisions that are used to classify examples. Such trees can also be used for numeric prediction by making only small adjustments to the tree growing algorithm. In this section, we will consider the ways in which trees for numeric prediction differ from trees used for classification.

Trees for numeric prediction fall into two categories. The first, known as regression trees, were introduced in the 1980s as part of the seminal classification and regression tree (CART) algorithm. Despite the name, regression trees do not use linear regression methods as described earlier in this chapter; rather, they make predictions based on the average value of examples that reach a leaf.

The CART algorithm is described in detail...

The rest of the chapter is locked

You're reading from Machine Learning with R Learn techniques for building and improving machine learning models, from data preparation to model tuning, evaluation, and working with big data

Table of Contents (18) Chapters

Understanding regression trees and model trees

Authors (1)

Personalised recommendations for you

You're reading from Machine Learning with R Learn techniques for building and improving machine learning models, from data preparation to model tuning, evaluation, and working with big data

Table of Contents (18) Chapters

Understanding regression trees and model trees

Unlock this book and the full library FREE for 7 days

Authors (1)

Personalised recommendations for you