| |
| | generation5 - Perceptrons |
 | | Learning on a perceptron is guaranteed, as stated by the Perceptron Convergence Theorem which states that if a solution can be implemented on a perceptron, the learning rule will find the solution in a finite number of steps. |
 | | Perceptrons can only classify data when the two classes can be divided by a straight line (or, more generally, a hyperplane)—this is called linear separation. |
 | | The first perceptron balances at {0,1,1} (remember, the first element is the bias), the second at {2,-1, -1} and the final one at {-1, 1, 1}. |
| www.generation5.org /content/1999/perceptron.asp (968 words) |
|