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 garbage collection and what is it used for, In computer science, ga...

In computer science, garbage collection (GC) is a form of automatic memory management. The garbage collector, or just collector, attempts to reclaim garbage, or memory occupied by

Explain in detail companding, Explain in detail companding. Companding...

Explain in detail companding. Companding: It is the process of compressing and expanding. This includes compressing the signal at the transmitter and expanding this at the re

Describe about digital audio tape, Q. Describe about Digital Audio Tape? ...

Q. Describe about Digital Audio Tape? The most proper tape for backing up data from a disk today is Digital Audio Tape (DAT). It employs a 4mm tape covered in a cartridge. It e

Layout for the assumed penalty, Solve the following 8-department problem us...

Solve the following 8-department problem using the MIP method.  What is the resulting layout and flow-distance score?  Note that the aspect ratio of each department should be 2.

Access to external identifiers, Access to External Identifiers: An external...

Access to External Identifiers: An external identifier is one which is referred in one module though defined in another. You can declare an identifier to be external by including i

Explain asynchronous decade counter, Draw the circuit diagram of Asynchrono...

Draw the circuit diagram of Asynchronous decade counter and explain its working. Ans: To  design  a  circuit diagram of decade  asynchronous  counter  initially  we  dr

The alignment of a type ''c'' field in a report, The alignment of a type 'c...

The alignment of a type 'c' field in a report is? ? Left Aligned.

Caption to commission rate, Get a listing of the name, commission rate, and...

Get a listing of the name, commission rate, and hire date of all salesmembers who sell to commercial customers. Sort the result in order from the 1st hired to the most recently hir

Hiring problem algorithm, Consider the Hire Assistant problem. We interview...

Consider the Hire Assistant problem. We interview n candidates and always hire the best qualified so far. Let n = 5 for our example. Find the probabilities that we hire exactly 1 t

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