Reading decision trees - artificial intelligence, Computer Engineering

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...

Posted Date: 10/3/2012 1:07:40 AM | Location : United States







Related Discussions:- Reading decision trees - artificial intelligence, Assignment Help, Ask Question on Reading decision trees - artificial intelligence, Get Answer, Expert's Help, Reading decision trees - artificial intelligence Discussions

Write discussion on Reading decision trees - artificial intelligence
Your posts are moderated
Related Questions
What are the different methods of passing data? There are three different methods of passing data Calling by reference    Calling by value Calling by value and result

Version Control is a critical tool in development and production environments that allows a user to make snapshots of working con?gurations or code. In this assignment, you will de

Q. What do you mean by Lock Synchronization? Lock Synchronization: In this method contents of an atom are updated by requester process and sole access is granted before atomic

Q. How is an instruction represented? Instruction is signified as a sequence of bits. A layout of an instruction is called as instruction format. Instruction formats are princi

What are the types of smart cards utilized in e-commerce? Usually, there are two types of smart cards as: Memory smart cards, that can be viewed by minuscule removable read

RDBMS relational database system - Relational databases are composed of relations and managed through relational operations, and governed through data integrity constraints.

What is the draw back of micro programmed control? It leads to a slower operating speed because of the time it takes to fetch microinstructions from the control store.

Explain about the term E-brokerage briefly. An e-brokerage is an investment house which allows you to buy and sell stocks and acquire investment information through its Web sit

The slowest sorting procedure is    Bubble Sort is the slowest sorting process.

what are the different techniques of biasing a transistor?