0
5.8kviews
Explain the perceptron learning with example.

Mumbai University > Computer Engineering > Sem 7 > Soft Computing

Marks: 5 Marks

Year: May 2016

1 Answer
2
138views

The Perceptron learning algorithm has been proved for pattern sets that are known to be linearly separable.

No such guarantees exist for the linearly non-separable case because in weight space, no solution cone exists. When the set of training patterns is linearly non-separable, then for any set of weights, W. there will exist some training example. Xk, such that Wk misclassifies Xk.

Consequently, the Perceptron learning algorithm will continue to make weight changes indefinitely.

Example:

enter image description here

input x = $( I_1, I_2, I_3) = ( 5, 3.2, 0.1 ).$

Summed input $$= \sum_i w_iI_i = 5 w_1 + 3.2 w_2 + 0.1 w_3$$

Please log in to add an answer.