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

Convention used to represent micro-operations, Q. Convention used to repres...

Q. Convention used to represent micro-operations? The convention used to represent micro-operations is: 1.  Computer register names are designated by capital letters (someti

What is python?, Python is an interpreter, interactive, object-oriented pro...

Python is an interpreter, interactive, object-oriented programming language. It is frequently compared to Tcl, P e r l, Scheme or Java. Python combines remarkable power with v

Which network connects multiple company locations, A/An                net...

A/An                network is typically a company network that connects multiple company locations into a single network. (A)  local area                                  (B

Illustrate 16-bit isa, Illustrate 16-bit ISA?  Compare it with 8-bit ISA bu...

Illustrate 16-bit ISA?  Compare it with 8-bit ISA bus.  The only difference between 8 and 16-bit ISA bus is that an extra connector is attached behind the 8-bit connector. 16-b

Control traffic flowing in and out of the network, Firewalls use one or mor...

Firewalls use one or more of three methods to control traffic flowing in and out of the network:  Packet filtering - Packets (small chunks of data) are examined against a s

Illustrate about packet switching, Q. Illustrate about Packet switching? ...

Q. Illustrate about Packet switching? Packet switching is used to avoid long delays in transmitting data over the network. Packet switching is a technique that limits the amoun

DBMS, what is dbms goal?

what is dbms goal?

Stepwise refinement of the program, What do you understand by stepwise refi...

What do you understand by stepwise refinement of the program? The method of "Stepwise refinement" means to take an object and move it from a general perspective to a exact leve

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

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