EECS 839 Homework Assignment #3 - Decision Tables and Trees, Assignments of Electrical and Electronics Engineering

Two homework assignments for the eecs 839 course in fall 2008. Students are required to determine certain and possible rules from decision tables using the same algorithms as their project, and to create a decision tree using the cart algorithm, voting for class membership, and cost-complexity pruning. The assignments are worth a total of 100 points, with 60 points for part 1 and 40 points for part 2.

Typology: Assignments

Pre 2010

Uploaded on 03/11/2009

koofers-user-yn9
koofers-user-yn9 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
EECS 839
Fall 2008
Homework Assignment # 3
due: November 20, 2008
60 pts. 1. For the following decision table
Attributes Decision
Temperature Headache Nausea Flu
1 98 ? no yes
2 100 yes yes yes
3 ? no no yes
4 98 yes yes yes
5 98 yes yes
6 96 yes no yes
7 96 no yes no
8 * yes * no
determine sets of certain and possible rules using the same algorithms as in
your project. Show your work.
40 pts 2 For the following decision table
Attributes Decision
Size Color Feel Attitude
1big yellow soft positive
2medium yellow medium positive
3medium blue medium neutral
4medium yellow medium neutral
5small yellow medium negative
6small yellow hard negative
7small yellow hard neutral
determine a decision tree using the CART algorithm, voting for determining
class membership, and cost-complexity pruning (assume α = 0.02). Show
your work.

Partial preview of the text

Download EECS 839 Homework Assignment #3 - Decision Tables and Trees and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

EECS 839

Fall 2008

Homework Assignment # 3

due: November 20, 2008

60 pts. 1. For the following decision table

Attributes Decision

Temperature Headache Nausea Flu

1 98? no yes 2 100 yes yes yes 3? no no yes 4 98 yes yes yes 5 98 – yes yes 6 96 yes no yes 7 96 no yes no 8 * yes * no

determine sets of certain and possible rules using the same algorithms as in your project. Show your work.

40 pts 2 For the following decision table

Attributes Decision

Size Color Feel Attitude

1 big yellow soft positive 2 medium yellow medium positive 3 medium blue medium neutral 4 medium yellow medium neutral 5 small yellow medium negative 6 small yellow hard negative 7 small yellow hard neutral

determine a decision tree using the CART algorithm, voting for determining class membership, and cost-complexity pruning (assume α = 0.02). Show your work.