Reading decision trees - artificial intelligence, Computer Engineering

Assignment Help:

Reading Decision Trees

There is a link between decision tree representation and logical representations, which may be exploited to form it more easy  to understand and learned decision trees. If we assume about it, each decision tree is actually a disjunction of implications (if ... then statements), and the implications are Horn clauses: a conjunction of literals implying a single literal. In the above tree, we may notice this by reading from the root node to each leaf node:

If the parents are tripping, then go to the cinema

or

If the parents are not tripping and it is sunny, then go fortennis

or

If the parents are not tripping and it is windy and you're wealthy, then go for shopping

or

If the parents are not tripping and it is windy and you're poor, then go to cinema

or

If the parents are not tripping and it is rainy, then stay inside.

Of course, this is only a re-statement of the actual mental decision making method we defined. Remember, however, that we will be programming an agent to learn decision trees from example, so this sort of conditions will not happen as we will start with just example conditions. It will therefore be important for us to be able to read the decision tree the agent advises.

Decision trees don't have to be representations of decision forming methods, and they can equally use to categorization problems. If we phrase the above question slightly in different way, we may see this: instead of saying that we need to represent a decision method for what to do on a weekend, we might ask what sort of weekend this is: is it a weekend where we play tennis, or one where we go for shopping, or one where we watch a film, or one where we stay inside? For other example, we can refer back to the animals example from the previous lecture:  in that  case, we wished to categories what group an animal was (mammal, fish, reptile, bird) using physical features (whether it lays eggs, number of legs, etc.). This could simply be phrased as a question of learning a decision tree to choose which category a given animal is in, e.g., if it lays eggs and is homoeothermic, then it's a bird, and so on...


Related Discussions:- Reading decision trees - artificial intelligence

What is a parent class of all java classes, Parent class of all Java classe...

Parent class of all Java classes is? All Java class's parent class is java. lang.object.

Programs portable on unix, How do you make programs portable on Unix and Do...

How do you make programs portable on Unix and Does under such circumstances? Constructors are invoked themself when the object is created for a class. There may be any number o

How control functions help in signalling and control, How different control...

How different control function categories help in signalling and control. Events happening outside the exchange on the line units, trunk junctions and inter exchange signalin

Example of ann - artificial intelligence, Example of ANN - artificial intel...

Example of ANN - artificial intelligence: ANNs look like this:   Notice that the x, w, z and y represent actual valued weights and that every the edges in this graph

C++ programming, how does a ohms law c++ programming works

how does a ohms law c++ programming works

Rules for minimisation using k maps, 1) All squares containing a 1 must be ...

1) All squares containing a 1 must be grouped. 2) The largest possible groups must be formed. 3) Groups can overlap if this allows larger groups to be formed. 4) Groups mu

Using binary search, A sorted file having 16 items. Using binary search, th...

A sorted file having 16 items. Using binary search, the maximum number of comparisons to find for an item in this file is The maximum number of comparison is 4

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