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
Adavantages and disadvantages of compilers and interpreters

Clear operation The clear operation compares words present in A and B and produces an all 0's result if two numbers are equal. This operation is achieved by the exclusive-OR mi

Q. How do you split Hydrogen and Oxygen gases in industrial electrolysis of water process? Answer:- In oxygen, electrolysis and hydrogen gas are produced at different elec

Explain Erasable Programmable ROM (EPROM) - Computer Memory? An EPROM is a ROM that can be reprogrammed and erased. A little glass window is installed at the top of the ROM pac

Problem Specification : Hence given the above context for "ILP" there we can state the learning problem as follows: that we are given a set of positive and a set of negative e

WAR (write after read) - Data hazards in computer architecture: WAR (write after read) - j tries to write at destination before it is read by i , hence i  wrongly gets the n

Parallel Computers In India, the design and development of parallel computers in progress in the early 80?s. The Indian Government recognized the Centre for Development of Adva

Paging supervisor: This part of the operating system built and manages the page tables. If the  due to dynamic address translation hardware a page fault occurs exception then

Advantages of Object oriented analysis design The OO approach inherently makes every object a standalone component which can be reused within specific stat problem domains we

When can a user program execution be interrupted? It won't be desirable to interrupt a program when an instruction is being executed and is in a state such as instruction decod