Decision trees - artificial intelligence, Computer Engineering

Assignment Help:

Decision Trees - Artificial intelligence:

Suppose you just ever do four things at the weekend: go shopping, watch a film, play tennis or just stay inside.  What you do depends on three things: the weather (windy, sunny or rainy); how much money you have (poor or rich) and whether your parents are tripping. You say to your yourself: if my parents are visit, tripping we'll go to the movie. If they're not tripping and also it's sunny, then I'll go for tennis, but if it's windy , and I'm wealthy, then I'll go shopping. If they're not tripping, it's windy and I'm poor, then I will go to the movie. If they're not tripping and it's rainy, then I'll stay inside.

To keep in mind all this, you draw a flowchart which will permit you to read off your conclusion. We call such diagrams decision trees. A fit decision tree for the weekend decision choices would be as follows:

 

998_Decision Trees.png

We may see that why such diagrams are called trees, because, while they are admittedly upside down, they start from a root and having branches leading to leaves (the tips of the graph at the downside). Note that the leaves are always decisions, and a particular decision should be at the end of various branches (for example, we might choose to go to the cinema for two different reasons).

Armed with our decision tree, on Saturday morning, when we rise up, all we have to do is check (a) the weather (b) how much money we have and (c) whether our parent's car is parked in the drive. The decision tree will then allow us to form our choice. assume, for example, that the parents haven't turned up and the sun is shining. Then this way through our decision tree will tell us what to do:

 

1681_Decision Trees1.png

and hence we run off to play tennis because our decision tree informed us to. Notice that the decision tree covers all eventualities.  That is,  there are  no  values that  the weather conditions, the parents turning up or the money condition must take which aren't provided for in the decision tree. Note that, in this lecture, we will be looking at how to repeatedly produce choice trees from examples, not at how to turn thought methods into decision trees.


Related Discussions:- Decision trees - artificial intelligence

How to pass data from list to report, How to pass data from list to report?...

How to pass data from list to report? ABAP/4 gives three ways of passing data: ---Passing data automatically using system fields ---Using statements in the program to tak

Explain that datagram cannot be larger than mtu of a network, "A datagram c...

"A datagram cannot be larger than the MTU of a network over which it is sent." Is the statement true or false? Explain with the help of a suitable example. All hardware technol

Differentiate between transport & session layer of osi model, Differentiate...

Differentiate between Transport and Session layers of OSI model. OSI Model Transport Layer The transport layer utilizes the services provided through the network layer, as

Which method is used for resolving data dependency, Which method is used fo...

Which method is used for resolving data dependency conflict by the compiler itself?  (A) Delayed load.   (B) operand forwarding.   (C) Pre fetch target instruction.  (D) loo

Explain combinational logic circuits, Explain Combinational logic circuits ...

Explain Combinational logic circuits Ans. Combinational logic circuits:- (i) Outputs only depend upon present state of the input. (ii) No memory element present or no f

What is meant by refreshing of the screen, What is meant by refreshing of t...

What is meant by refreshing of the screen?  Some method is required for maintaining the picture on the screen. Refreshing of screen is completed by keeping the phosphorus glowi

What is assembler, What is Assembler An assembler is a program which ta...

What is Assembler An assembler is a program which takes as input a symbolic language program and produces output as its binary machine language equivalent. The input is known a

Explain level of a node, Level of a node The root is at level zero and ...

Level of a node The root is at level zero and the level of the node is 1 more than the level of its parent

How address resolution is performed with table lookup, How address resoluti...

How address resolution is performed with table lookup? Explain with the help of a suitable example. The approach of table lookup to address resolution needs a data structure wh

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