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

Explain the linux from scratch system, Problem 1 (a) Explain the RAID ...

Problem 1 (a) Explain the RAID system and explain all possible configurations. (b) Summarize design goals, features and specifications of the Linux ext2 file system. (c

What will be its digital output of an 8-bit ADC, An 8-bit successive approx...

An 8-bit successive approximation ADC has a resolution of 20mV.  What will be its digital output for an analog input of 2.17V? Ans: Given data Resolution =20mv Analog input =2.

Convert, haw to convert context free grammar to regular grammar

haw to convert context free grammar to regular grammar

Gustafsons law, Amdahl's law is suitable for applications where response ti...

Amdahl's law is suitable for applications where response time is critical. On the other hand, there are a lot of applications which need that accuracy of the resultant output shoul

What do you mean by single construct in fortan, Q. What do you mean by Sing...

Q. What do you mean by Single Construct in FORTAN? Single construct specifies the associated structured block is executed by just one thread in team (not essentially the master

Determine about the the difference engine - pascaline, THE DIFFERENCE ENGIN...

THE DIFFERENCE ENGINE - Pascaline The difference enigne was based on the mathematical principle of finite differences and was used to solve calculations based on large numbers

What are the ways to truncate guard bits, What are the ways to truncate gua...

What are the ways to truncate guard bits? 1. Chopping 2. Von Neumann rounding 3. Rounding procedure.

Overflow or underflow for floating point numbers, In floating point numbers...

In floating point numbers when so you say that an overflow or underflow has occurred? Ans: A) In single precision numbers when an exponent is less than +127 then we say that

Timing in mpi program, Q. Timing in MPI program? MPI_Wtime ( ) returns ...

Q. Timing in MPI program? MPI_Wtime ( ) returns lapsed wall clock time in seconds because some random point in past. Elapsed time for program section is given by difference bet

How many bits are required for a ladder d/a converter, How many bits are re...

How many bits are required at the input of a ladder D/A converter, if it is required to give a resolution of 5mV and if the full scale output is +5V. Find the %age resolution.

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