liveBook · Manning

Random forest

As explained in Investing for Programmers

A random forest is an ensemble algorithm that combines predictions from multiple decision trees.

A random forest combines predictions from multiple decision trees. For stock-price prediction, it learns from historical market features and estimates the next day’s closing price. section 8.1.2

Stock-price prediction

The forecast tracks actual prices unevenly: some predictions are close, while others differ substantially. More data or another algorithm, such as ARIMA, may improve results in some cases. section 8.1.2

How Investing for Programmers covers it

How deep it goes
Demonstrates data preparation, chronological splitting, fitting, prediction, RMSE validation, and plotting, but not tree internals.
Examples
Uses AAPL historical prices, next-day closing-price labels, RMSE, and actual-versus-forecast plots.
What it assumes
Assumes basic labeled-data and supervised-learning ideas while demonstrating feature-label construction and train-test validation.
What you can do after
Build it from scratch with Python data libraries and evaluate predictions against held-out historical prices.
How it connects
Connects supervised learning with overfitting, feature selection, time-series prediction, and ARIMA.

Also explained in

Compare how 11 books explain random forest →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Investing for Programmers. The section links point to the parts of the book it draws on.