0
6.6kviews
Explain the perceptron learning with example.

Mumbai University > Computer Engineering > Sem 7 > Soft Computing

Marks: 5 Marks

Year: May 2016

1 Answer
2
152views

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. …

Create a free account to keep reading this post.

and 3 others joined a min ago.

Please log in to add an answer.