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
Explain the need for user-defined functions. The need for user-defined function: 1.  A programmer might be having a block of code that he has repeated forty times all over t

What is time slicing? With this technique each program runs for a short period known as a time slice, and then another program runs for its time slice and so on.

why we use void main in c progrmeing

Unification - Artificial intelligence: We have said that the laws of inference for propositional logic detailed in the previous lecture can also be used in first-order logic.

Q. Explain functions of direct memory access? Though CPU intervention in DMA is minimised however it should use path between interfaces that is system bus. So DMA involves an e

What are the properties of E-cash? Properties: a. Monetary Value: It must be backed through either cash, bank –certified cashier’s cheque and authorized credit cards.

DADA Electronics makes CD players in 3 processes: programming, and packaging. Direct materials are added at the starting of the assembly process. Conversion costs are incurred even

What are the Barcode readers These collect data from printed barcodes and allow automatic stock control in, for illustration, supermarkets.

Q. What do you mean by shopping bots? ANSWER: A shopping bot or buyer agent is an intelligent agent on a Web site that assists you, the customer, search the products and servic

State the Tips of timescale directive Include a `timescale directive at the top of each module, even if there are no delays i n the module, since some simulators may require th