CSCE 478/878 (Fall 2008) Homework 3

Assigned Friday, October 31
Due Sunday, November 16 at 11:59 p.m.

When you hand in your results from this homework, you should submit the following, in separate files:

1. A single .tar.gz or .tar.Z file (make sure you use a UNIX-based compression program) called username.tar.gz where username is your username on cse. In this tar file, put:
   • Source code in the language of your choice.
   • A makefile and a README file facilitating compilation and running of your code (include a description of command line options). If we cannot easily re-create your experiments, you might not get full credit.
   • All your data and results (in plain text files).
2. A single .pdf file with your writeup of the results for all the homework problems, including the last problem. Only pdf will be accepted, and you should only submit one pdf file, with the name username.pdf, where username is your username on cse. Include all your plots in this file, as well as a detailed summary of your experimental setup, results, and conclusions. If you have several plots, you might put a few example ones in the main text and defer the rest to an appendix. Remember that the quality of your writeup strongly affects your grade. See the web page on "Tips on Presenting Technical Material".

1. (50 pts) Implement one of the following learning algorithms:
   1. A naïve Bayes classifier, using m-estimates for the probabilities to work around attribute values that are unused in the training set.
   
   
   2. A k nearest neighbor classifier, using at least one value of k.
   
   Run your classifier on the same data sets that you used in the previous homeworks. Report your error results with either confidence intervals or with ROC analysis and compare them to the results from previous homeworks.


2. (5 pts) State how many hours you spent on each problem of this homework assignment.

The following problem is only for students registered for CSCE 878. CSCE 478 students who do it will receive extra credit, but the amount will be less than the number of points indicated.

3. (15 pts) Do Problem 6.3 on p. 198.