DeepRead
Cover of Classification and regression trees

Classification and regression trees

Leo Breiman · 1984

Machine learning, statistics and probability › Bayesian and probabilistic modeling

#4,695 most recommended

About the book

This monograph by Leo Breiman, Jerome Friedman, Richard Olshen and Charles Stone presents CART, a method for building binary decision trees that predict either a categorical class or a continuous value from a set of predictor variables. It covers tree construction, pruning, error estimation, and the handling of missing data, and is framed as statistical methodology illustrated with applied examples. The authors contend that recursive binary splitting produces predictors that are both accurate and interpretable when the tree-building procedure is done carefully. They argue that growing a large tree and then pruning it back with a cost-complexity criterion works better than stopping growth early, which is unreliable. They also hold that the error of a chosen tree should be estimated honestly, using cross-validation or a test sample, and that surrogate splits give a principled way to cope with missing predictor values.

Written by Claude from what it knows of this book.

What Hacker News says 25% recommend · 0% critical

051020112015202020222016 peak · 6
This bookAverage book in Bayesian and probabilistic modeling

In the commenters’ own words

What Open Library readers say 5.00 from 2 ratings

  1. 52
  2. 40
  3. 30
  4. 20
  5. 10
  • 11 want to read
  • 1 reading
  • 2 have read

Only 2 ratings: treat the average as a hint.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1984
ISBN
9780534980542
Editions known
14 at Open Library
Open Library
OL18354262W

Discriminant analysisRegression AnalysisRegression analysisStatisticsTrees (Graph theory)

Explore in the mosaic

Read next: its neighbours on the mosaic