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

What is a snooping cache, DNS cache snooping is not a term the author just ...

DNS cache snooping is not a term the author just made up, it is called and discussed by some notable DNS execution developers, and a few interested DNS administrators have prob

Transportation model, advantages and disadvantages of northwest corner meth...

advantages and disadvantages of northwest corner method and least cost method

Computer graphics, list out of merit and de-merit plasma display

list out of merit and de-merit plasma display

An algorithm, find cos(x) and sin(x) an pseudocode (while loop

find cos(x) and sin(x) an pseudocode (while loop

Explain the technique used in asymmetric key cryptography, Explain the tech...

Explain the technique used in the asymmetric Key Cryptography. Asymmetric or public-key cryptography be different from conventional cryptography in which key material is bound

Enumerate about the trackball device, Enumerate about the trackball A t...

Enumerate about the trackball A trackball is a two-dimensional positioning device, a spaceball provides six degrees of freedom. Unlike the trackball, a spaceball does not actua

8085 programs, what is the theory used to check whether a number is negativ...

what is the theory used to check whether a number is negative or positive?

How much duration is required for an off-hook signal, An off-hook signal wi...

An off-hook signal will repeat for a/an                   duration. For a/an finite duration, an off-hook signal will repeat.

Show the advantages of joint application development, Q. Show the advantage...

Q. Show the advantages of Joint Application Development? The following are the numerous advantages of Joint Application Development: Actively includes management and use

Array to be sorted is partitioned again and again, The sorting method where...

The sorting method where array to be sorted is partitioned again and again in such a way that all elements less than or equivalent to partitioning element appear before it and thos

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