CART and Prediction

Alex Coad ()

Chapter Chapter 10 in Data Science MBA, 2025, pp 125-138 from Springer

Abstract: Abstract This chapter introduces Classification and Regression Trees (CART) as powerful tools for prediction. It presents the CART algorithm, the greedy nature of the algorithm, and how it can be used for both classification and regression tasks. The chapter also discusses Random Forests as an extension of CART, that leads to increased predictive accuracy by aggregating multiple decision trees. Examples in R illustrate the application of CART and Random Forests to real estate data, demonstrating their practical use in predictive modeling.

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sptchp:978-981-95-2433-4_10

Ordering information: This item can be ordered from
http://www.springer.com/9789819524334

DOI: 10.1007/978-981-95-2433-4_10

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().