Theory of Intelligence
MACHINE LEARNING•Classic Algorithms•Ensemble Learning•3.1 Voting Classifiers

Introduction

Why a group of models often beats its best member (the wisdom of the crowd), and how hard and soft voting combine their predictions.

Introduction

Ask one person to guess the number of sweets in a jar and they'll probably be quite far off. Ask a thousand people and average their guesses, and the result is often amazingly close — closer than almost every individual guess. This is the wisdom of the crowd.

Ensemble learning applies the same idea to ML: combine the predictions of several models (an ensemble) to get a better prediction than any single one. Ensembles regularly win machine learning competitions, and random forests and gradient boosting — the stars of this chapter — are ensembles of decision trees.

We start with the simplest ensemble: letting different models vote.

Discuss theoretical concepts, mathematical formulas, and architectural foundations.

Supports inline code with `backticks`
No comments yet. Be the first to start the discussion!