Homework 4 Questions - Machine Learning | CMSC 726, Assignments of Computer Science

Material Type: Assignment; Class: MACHINE LEARNING; Subject: Computer Science; University: University of Maryland; Term: Spring 2006;

Typology: Assignments

Pre 2010

Uploaded on 07/30/2009

koofers-user-3xb
koofers-user-3xb 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CMSC 726 Homework 4
Due Date: Thursday, April 6, at the start of class
In this assignment, you will complete the exploration of classifier performance on your
dataset.
1. [40 points] Using WEKA, compare the performance of the new methods we have
seen (DecisionTrees, kNN, Neural Networks, SVMs) on your dataset.
(a) Turn in a learning curve, showing the performance of these algorithms, along with
your earlier results using logistic regression and naive Bayes from homework 2.
As before use 5-fold cross validation.
(b) For the largest size training set, turn in a table which has the average accuracy
and the standard deviation for each of the classifiers.
(c) Which performs best? Is this result statistically significant?
(d) Include a discussion of your results.
2. [60 points] In this question, you will implement a linear threshold unit (LTU) and
an ensemble method, and compare with your earlier performance using LR and NB.
(a) Implement your own version of a linear threshold unit (single node neural net-
work). You can implement any reasonable variation that you like. You may use
whatever language with which you are most comfortable (C, Java, Matlab, Perl,
etc.).
(b) Compare the performance with your LR and NB classifiers.
(c) Implement an ensemble method of your choice, using your LTU, LR and/or NB
classifiers as you like.
(d) Turn a discussion of your results and a printout of the main portions of your
implementation.

Partial preview of the text

Download Homework 4 Questions - Machine Learning | CMSC 726 and more Assignments Computer Science in PDF only on Docsity!

CMSC 726 Homework 4

Due Date: Thursday, April 6, at the start of class

In this assignment, you will complete the exploration of classifier performance on your dataset.

  1. [40 points] Using WEKA, compare the performance of the new methods we have seen (DecisionTrees, kNN, Neural Networks, SVMs) on your dataset.

(a) Turn in a learning curve, showing the performance of these algorithms, along with your earlier results using logistic regression and naive Bayes from homework 2. As before use 5-fold cross validation. (b) For the largest size training set, turn in a table which has the average accuracy and the standard deviation for each of the classifiers. (c) Which performs best? Is this result statistically significant? (d) Include a discussion of your results.

  1. [60 points] In this question, you will implement a linear threshold unit (LTU) and an ensemble method, and compare with your earlier performance using LR and NB.

(a) Implement your own version of a linear threshold unit (single node neural net- work). You can implement any reasonable variation that you like. You may use whatever language with which you are most comfortable (C, Java, Matlab, Perl, etc.). (b) Compare the performance with your LR and NB classifiers. (c) Implement an ensemble method of your choice, using your LTU, LR and/or NB classifiers as you like. (d) Turn a discussion of your results and a printout of the main portions of your implementation.