Decision trees - artificial intelligence, Computer Engineering

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.

Posted Date: 10/3/2012 1:06:05 AM | Location : United States







Related Discussions:- Decision trees - artificial intelligence, Assignment Help, Ask Question on Decision trees - artificial intelligence, Get Answer, Expert's Help, Decision trees - artificial intelligence Discussions

Write discussion on Decision trees - artificial intelligence
Your posts are moderated
Related Questions
If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms?

What is the maximum number of fragments that can result from a single IP Datagram? Explain. To fragment a datagram for transmission across a network, a router utilizes the netw

Discuss the 5-level switching hierarchy recommended by CCITT. Hierarchical networks are able of handling heavy traffic where needed, and at similar time use minimal number of t

What is double data rate SDRAM?  Double data rates SDRAM are those which can transfer data on both edges of the clock and their bandwidth is fundamentally doubled for long burs

Q. What is Building and Running MPI Programs? MPI parallel programs are written using conventional languages such as FORTRAN and C. One or more header files like 'mpi.h' may be

What is the maximum size of a database that can be opened in Microsoft Access? Ans) 1 Gigabyte

Can we use WRITE statements in screen fields? If not how is data transferred from field data to screen fields? We cannot write field data to the screen using the WRITE stateme

Difference between static and dynamic RAM. Draw the circuits of one cell of each and explain its working. Ans: Differentiation among Static RAM and Dynamic RAM: Static

Functioning of registers: at any instance of time global registers and only one window of registers is visible and is addressable as if it were only set of registers. So for progra

What is a 3-D Accelerator?  3-D Accelerator is no magic technology. It is merely an accelerator chip which has built-in ability to perform the mathematics and algorithms neede