The linear boundaries produced by a minimum-Euclidean-distance classifier
may not be flexible enough. For example, if x1 is the perimeter
and x2 is the area of a figure, x1 will grow linearly
with scale, while x2 will grow quadratically. This will "warp"
the feature space and prevent a linear discriminant function from performing
well.
Solutions:
- Redesign the feature set (e.g., let x2 be the square root of the area)
- Try using Mahalanobis distance, which can produce quadratic decision boundaries (see ahead)
- Try using a neural network (beyond the scope of these notes; see Haykin)