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

Explain 32 to 1 multiplexer tree, Why is Multiplexer Tree needed? Draw ...

Why is Multiplexer Tree needed? Draw the block diagram of a 32:1 Multiplexer Tree and explain how input is directed to the output in this system. Ans. One of the possible

Cache memories - computer architecture, Cache Memories - computer architect...

Cache Memories - computer architecture: Speed of the primary memory is very low in comparison with the speed of processor For well performance, the processor can't spend

What are the types of assemblies, What are the Types of Assemblies? One...

What are the Types of Assemblies? One of the drawback of using Visual Studio.NET and the .NET framework to develop applications has been the lack of cross-platform support. As

Search method for searching a sorted file, The search method for searchi...

The search method for searching a sorted file that needs increased amount of space is The search technique for searching a sorted file that needs increased amount of space

Explain use of mpi functions with an example, Q. Explain use of MPI functio...

Q. Explain use of MPI functions with an example? include int main(int argc, char **argv) { int i, tmp, sum, s, r, N, x[100]; MPI_Init(&argc, &argv); MPI_Comm_size

C++ language, Write a program to find the area under the curve y = f(x) bet...

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Explain sample instruction format of mips instruction, Q. Explain Sample In...

Q. Explain Sample Instruction Format of MIPS instruction? All MIPS instructions are of same size and are 32 bits long. MIPS designers chose to keep all instructions of same len

Quick sort , Write Quick sort non recursive program

Write Quick sort non recursive program

What is unordered lists, Q. What is Unordered Lists? First, we will bui...

Q. What is Unordered Lists? First, we will build an unordered list. Many times, these lists are also termed as bulleted lists. These lists are characterized by list items which

What is FIFO, What is FIFO? FIFO is used as buffering element or queui...

What is FIFO? FIFO is used as buffering element or queuing element into the system that is by common sense, is needed only while you slow at reading than the write operation.

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