liveBook · Manning

Feature map

As explained in Grokking Machine Learning

A mapping that sends data points from an original input space into another feature space, usually of higher dimension.

A feature map sends each data point from its original space into another, usually higher-dimensional, space. Adding a carefully chosen column can turn a curved separation problem into a linear one: (x1, x2) becomes (x1, x2, x1x2), where a plane can separate the points. section 11.3

The transformation supports nonlinear classification by:

  • Adding polynomial features such as x1², x1x2, and x2². section 11.3
  • Adding similarity columns based on distances to reference points, as with an RBF feature map. section 11.3
  • Training a linear classifier in the expanded space, then viewing its projected boundary in the original space. section 11.3

From a curved boundary to a plane

For a circular dataset, add x1² + x2² as a third coordinate. The raised points can be separated by a plane; projecting that plane back produces a circular classifier boundary.

How Grokking Machine Learning covers it

How deep it goes
Explains geometric mapping and polynomial and RBF examples, while deferring the full theory of kernels and feature maps.
Examples
Uses x1x2, quadratic columns, similarity columns, XOR-style points, circular datasets, and projected planes or curves.
What it assumes
Assumes familiarity with datasets, coordinates, labels, linear classifiers, and SVM classification.
What you can do after
Apply it via SVC with polynomial or RBF kernels to classify datasets with curved boundaries.
How it connects
Connects feature maps to kernels, SVMs, linear classifiers, polynomial kernels, RBF kernels, and nonlinear decision boundaries.

Also explained in

Compare how 8 books explain feature map →

Related concepts

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