LT-4 - Output: Knowledge representation Decision trees...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Output: Knowledge representation x Decision trees x Decision rules x Association rules x Rules with exceptions x Rules involving relations x Clusters 1 Decision tables Simplest way of representing output: Use the same format as input! Decision table for the weather problem: Main problem: selecting the right attributes Outlook Humidity Play Sunny High No Sunny Normal Yes Overcast High Yes Overcast Normal Yes Rainy High No Rainy Normal No 2
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Decision trees “Divide-and-conquer” approach produces tree Nodes involve testing a particular attribute Usually, attribute value is compared to constant Other possibilities: Comparing values of two attributes Using a function of one or more attributes 3 If the attribute that is tested at a node is a nominal one, the number of children is usually the number of possible values of the attribute. In this case, because there is one branch for each possible value, the same attribute will not be retested further down the tree. WHY?
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/06/2011 for the course DM 301 taught by Professor Dr.abdulazizgil during the Spring '11 term at American.

Page1 / 8

LT-4 - Output: Knowledge representation Decision trees...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online