Solution of multi-layer ann with sigmoid units, Computer Engineering

Assignment Help:

Solution of multi-layer ann with sigmoid units:

Assume here that we input the values 10, 30, 20 with the three input units and from top to bottom. So after then the weighted sum coming into H1 will be as: 

SH1 = (0.2 * 10) + (-0.1 * 30) + (0.4 * 20) = 2 -3 + 8 = 7. 

After then the σ function is applied to SH1 to give as: 

σ(SH1) = 1/(1+e-7) = 1/(1+0.000912) = 0.999 

Here don't forget to negate S. Also the weighted sum coming into H2 will be as: 

SH2 = (0.7 * 10) + (-1.2 * 30) + (1.2 * 20) = 7 - 36 + 24 = -5 

Now next σ applied to SH2 gives as: 

σ(SH2) = 1/(1+e5) = 1/(1+148.4) = 0.0067 

Furthermore from this we can see there that H1 has fired, but H2 has not. So now we can calculate the weights sum going in to output in unit O1 will be as: 

SO1 = (1.1 * 0.999) + (0.1*0.0067) = 1.0996 

And here next the weighted sum going in to output in unit O2 will be as: 

SO2 = (3.1 * 0.999) + (1.17*0.0067) = 3.1047 

However the output sigmoid unit in O1 will now calculate the output values from the network for O1 as:

 σ(SO1) = 1/(1+e-1.0996) = 1/(1+0.333) = 0.750 

and the output from the network for O2: 

σ(SO2) = 1/(1+e-3.1047) = 1/(1+0.045) = 0.957 

However therefore if this network represented the learned rules for a categorisation problem then the input triple (10,30,20) would be categorised into the category associated with O2 it means it has the larger output.


Related Discussions:- Solution of multi-layer ann with sigmoid units

Advantage and disadvantage of threaded binary trees, Advantage  1.     ...

Advantage  1.       By doing threading we neglect the recursive method of traversing a Tree , which makes use of stack and consumes many memory and time . 2.       The node

Graph to display the variable, We will be using data from the 2008 Canadian...

We will be using data from the 2008 Canadian General Election Study.1 The data can be found on the course page. As well, there are three other documents (loosely called "codebooks"

Explain recursive descent parsing, Explain Recursive Descent Parsing It...

Explain Recursive Descent Parsing It is a top down parsing with no backtracking. This parsing method uses a set of recursive processes to perform parsing. Most important advant

What is object repository, Object Repository means not a set of objects. ...

Object Repository means not a set of objects. It's a common repository for all the people (Testing, Developers) for seeing all the data in one Login. For example QA needs

What is the difference between tcp and udp, TCP and UDP are both transport-...

TCP and UDP are both transport-level protocols. TCP is designed to give reliable statement across a variety of reliable and unreliable networks and internets. UDP gives a conne

Determine the fastest logic, Which of the fastest logic: TTL, ECL, CMOS and...

Which of the fastest logic: TTL, ECL, CMOS and LSI ? Ans. The fastest logic family of all logic families ECL. High  speeds  are  possible  in  ECL  since the  transistors  a

Interaction design and human–computer interaction, You should now have a re...

You should now have a reasonably clear understanding of what is meant by interaction design. However, there are several other terms which are often used to refer to particular aspe

Give solution for readers-writers problem, Give a solution for readers-writ...

Give a solution for readers-writers problem using conditional critical regions. Solution for readers-writers problem using conditional critical regions: Conditional critical

Registers used in organisation of an associative memory, In the organisatio...

In the organisation of an associative memory, many registers are used: Comparand Register (C): This register is used to grasp the operands, which are being searched for, or

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