liveBook · Manning

Hyperplane

As explained in Machine Learning Algorithms in Depth

A hyperplane is a flat affine subspace whose dimension is one less than that of its ambient space.

A hyperplane is a flat affine subspace with dimension one less than its ambient space. In d-dimensional feature space, the equation θᵀx + θ₀ = 0 defines a hyperplane determined by normal vector θ and offset θ₀. section 5.2

For a linear classifier, this hyperplane is the decision boundary. The sign of θᵀx + θ₀ assigns a point to one of two labels: points on the normal-vector side receive +1, while points on the opposite side receive −1. section 5.2

Perceptron decision boundary

A perceptron uses θᵀx + θ₀ = 0 to separate two classes. In two dimensions, the boundary appears as a line; in higher-dimensional feature spaces, it remains a codimension-one separating surface. Applying the classifier to iris data produces predictions that can be analyzed with a confusion matrix. section 5.2

Useful geometric tasks include:

  • Determine which side of the hyperplane contains a point by evaluating the sign of θᵀx + θ₀. section 5.2
  • Compute the Euclidean distance from a point y to the hyperplane θᵀx + θ₀ = 0. section 5.7

How Machine Learning Algorithms in Depth covers it

How deep it goes
Defines the geometric role and classification rule, then stops short of deriving the point-to-hyperplane distance.
Examples
Illustrates a two-dimensional boundary and applies perceptron classification to the iris dataset.
What you can do after
Evaluate linear-classifier geometry by identifying class sides and computing point-to-hyperplane Euclidean distances.
How it connects
Connects hyperplanes to linear classifiers, normal vectors, decision boundaries, binary classification, and Euclidean distance.

Also explained in

Compare how 6 books explain hyperplane →

Related concepts

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