Scribd
Upload
4 views

Homework3

Uploaded by

salah.abdo.tech
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Homework3

Uploaded by

salah.abdo.tech
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

For Questions 1- 4, please submit a word file or a PDF file;

For Question 5 (programming question), please submit an .ipynb file.

Question 1: [4 points] Explain what is the bias-variance trade-off? Describe few techniques to
reduce bias and variance respectively.

Question 2: [6 points] Assume the following confusion matrix of a classifier. Please compute its
1) precision,
2) recall, and
3) F1-score.

Predicted results
Actual values

Class 1 Class 2
Class 1 50 30
Class 2 40 60

Question 3: [10 points] Build a decision tree using the following training instances (using
information gain approach):

Applied Machine Learning – CPE 695 © 2 0 2 1 - 1 -

ST E VEN S I N ST I T U T E oƒ T EC H N O L O G Y
Question 4. [10 points] The naïve Bayes method is an ensemble method as we learned in
Module 5. Assuming we have 3 classifiers, and their predicted results are given in the table 1.
The confusion matrix of each classifier is given in table 2. Please give the final decision using the
Naïve Bayes method:

Table 1 Predicted results of each classifier


Sample x Result

Classifier 1 Class 1

Classifier 2 Class 1

Classifier 3 Class 2

Table 2 Confusion matrix of each classifier


i) Classifier 1 ii) Classifier 2 iii) Classifier 3

Class1 Class2 Class1 Class2 Class1 Class2

Class1 40 10 Class1 20 30 Class1 50 0

Class2 30 20 Class2 20 30 Class2 40 10

Question 5: Programming (40 points):

Use decision tree and random forest to train the titanic.csv dataset included in the assignment.

Step 1: Read in Titanic.csv and observe a few samples, some features are categorical, and
others are numerical. If some features are missing, fill them in using the average of the same
feature of other samples. Take a random 80% samples for training and the rest 20% for test.

Step 2: Fit a decision tree model using independent variables ‘pclass + sex + age + sibsp’ and
dependent variable ‘survived’. Plot the full tree. Make sure ‘survived’ is a qualitative variable

Applied Machine Learning – CPE 695 © 2 0 2 1 - 2 -

ST E VEN S I N ST I T U T E oƒ T EC H N O L O G Y
taking 1 (yes) or 0 (no) in your code. You may see a tree similar to this one (the actual structure
and size of your tree can be different):

Step 3: Use the GridSearchCV() function to find the best parameter max_leaf_nodes to prune the
tree. Plot the pruned tree which shall be smaller than the tree you obtained in Step 2.

Step 4: For the pruned tree, report its accuracy on the test set for the following:

percent survivors correctly predicted (on test set)


percent fatalities correctly predicted (on test set)

Step 5: Use the RandomForestClassifier() function to train a random forest using the value of
max_leaf_nodes you found in Step 3. You can set n_estimators as 50. Report the accuracy of
random forest on the test set for the following:

percent survivors correctly predicted (on test set)


percent fatalities correctly predicted (on test set)

Check whether there is improvement as compared to a single tree obtained in Step 4.

Applied Machine Learning – CPE 695 © 2 0 2 1 - 3 -

ST E VEN S I N ST I T U T E oƒ T EC H N O L O G Y

You might also like