Perceptron training, Computer Engineering

Perceptron training:

Here the weights are initially assigned randomly and training examples are needed one after another to tweak the weights in the network. Means all the examples in the training set are used and the entire process as using all the examples again is iterated until all examples are correctly categorised through the network. But the tweaking is called as the perceptron training ruleso then is as follows: There if the training example, E, or is correctly categorised through the network so then no tweaking is carried out. Whether E is mis-classified and then each weight is tweaked by adding on a small value and Δ. Let suppose here that we are trying to calculate weight wi that is between the i-th input unit and xi and the output unit.

After then given that the network should have calculated the target value t(E) as an example E but in reality we calculated the observed value o(E) and then Δ is calculated as: 

Δ = η (t(E)- o(E))xi 

Always note that η is a fixed positive constant that called the learning rate. By ignoring η briefly we can see that the value Δ that we add on to our weight wi is calculated through multiplying the input value xi through t(E)  -  o(E). t(E)  -  o(E) will either be +2 or -2 it means that perceptrons output only +1 or  -1 so t(E) cannot be equal to o(E) or else we wouldn't be doing any tweaking. Now we can think of t(E) - o(E) as a movement in a general numerical direction that is, positive or negative. It means that this direction will be like, if the overall sum, S, was too low to get over the threshold and produce the correct categorisation  rather then the contribution to S from wi  * xi will be increased.

Posted Date: 1/11/2013 7:00:35 AM | Location : United States







Related Discussions:- Perceptron training, Assignment Help, Ask Question on Perceptron training, Get Answer, Expert's Help, Perceptron training Discussions

Write discussion on Perceptron training
Your posts are moderated
Related Questions
Prove the following Boolean identities using the laws of Boolean algebra (A + B)(A  + C) = A + BC Ans. (A+B)(A+C)=A+BC LHS AA+AC+AB+BC=A+AC+AB+BC OR  A((C+1)+A(B+1))+BC

Determine the advantages of sixth generation computers One of the major dramatic changes in sixth generation will be the explosive growth of wide area networking. Network bandw

#quest2. Each time a defect gets detected and fixed, the reliability of a software production..

A logic gate is an electronic circuit that generates a typical output signal which depends on its input signal. Output signal of a gate is a general boolean operation of its input

a. What is the meaning of user interaction? What are the dissimilar styles in which forms of interaction can be classified? Give one advantage, disadvantage and an example of every

Explain difference between Security and Protection? Protection mechanism: The subsequent mechanisms are commonly utilized for protecting files having programs and data. (a

Types E-commerce generally based on advertising, selling, marketing and buying, but due to the differences in needs, e-commerce has been classified according to the parties of the

Discuss in detail Table management Techniques? An Assembler uses the subsequent tables: OPTAB: Operation Code Table consists of mnemonic operation code and machine langua

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve betw   #includ

What are various types of Shift Registers ? Ans: Kinds of Shift Registers: (i) SISO that is Serial-In Serial-Out Shift Register (ii) SIPO that is Serial-In P