Perceptron training, Computer Engineering

Assignment Help:

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.


Related Discussions:- Perceptron training

What do understand by the granularity of a parallel system, What do underst...

What do understand by the granularity of a parallel system ? Granularity refers to the quantity of computation complete in parallel relative to the size of the entire program. I

State and prove any one of the demorgen''s laws, Q. F(x,y,z) = ∑m (4,6,7,8...

Q. F(x,y,z) = ∑m (4,6,7,8)+ ∑d (2,5,11,12) Using K-Map. Q. State and prove any one of the DeMorgen's Laws. Show that these theorems can be extended up to any number of variabl

Describe set-associative mapping, Q. Describe Set-Associative Mapping? ...

Q. Describe Set-Associative Mapping? A third type of cache organization known as set-associative mapping is an improvement on direct mapping organization in that every word of

Why erlang is used, Erlang is used to (A) Measure busy period         ...

Erlang is used to (A) Measure busy period                (B) Give total busy period in minutes (C)  Measure average call rate       (D) Indicate total call period Ans

Define register file, Define register file. All general purpose registe...

Define register file. All general purpose registers are combined into a one block called the register file.

What is open addressing, Open addressing:  The easiest way to resolve a co...

Open addressing:  The easiest way to resolve a collision is to begin with the hash address and do a sequential search by the table for an empty location. The idea is to place the

What are the different sections of a report, What are the different section...

What are the different sections of a report? A report is categorized into many sections: The Report header: In this you place a control which must appear only at the startin

What is process control block, What is process control block?  Each pro...

What is process control block?  Each process is shown in the OS by a process control block. It having many pieces of information associated with a specific process.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd