In geometry, when two sets of points in a two-dimensional graph can be completely separated by a single line, they are said to be linearly separable. In general, two groups are linearly separable in n-dimensional space if they can be separated by an n − 1 dimensional hyperplane. nub // Introduction Geometry (Greek ÎεÏμεÏÏια, geo = earth, metria = measure ) arose as the field of knowledge dealing with spatial relationships. ... In geometry, a hyperplane is a linear, affine, or projective subspace of codimension 1. ...
Now let us extend the discussion into the separation of points into two regions that are not linearlyseparable.
With four perceptrons that are independent of each other in the hidden layer, the point is classified into 4 pairs of linearlyseparable regions, each of which has a unique line separating the region.
The top perceptron performs logical operations on the outputs of the hidden layers so that the whole network classifies input points in 2 regions that might not be linearlyseparable.