{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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 xrhombus Decision trees xrhombus Decision rules xrhombus Association rules xrhombus Rules with exceptions xrhombus Rules involving relations xrhombus 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 Document Right Arrow Icon
2 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.
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.

{[ snackBarMessage ]}