cs401r_w2016:lab5
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
cs401r_w2016:lab5 [2016/01/12 16:13] admin |
cs401r_w2016:lab5 [2021/06/30 23:42] (current) |
||
|---|---|---|---|
| Line 10: | Line 10: | ||
| {{ :cs401r_w2016:lab3_digits.png?direct&300|}} | {{ :cs401r_w2016:lab3_digits.png?direct&300|}} | ||
| - | - Generate a visualization of the expected value of each class, where the density over classes is estimated using a kernel density estimator (KDE). The data for these KDEs should come from the MNIST training data (see below). Your notebook should generate 10 images, arranged neatly, one per digit class. Each image might look something like the one on the right. | + | - Generate a visualization of the expected value of each class, where the density over classes is estimated using a kernel density estimator (KDE). The data for these KDEs should come from the MNIST training data (see below). Your notebook should generate 10 images, arranged neatly, one per digit class. Your image might look something like the one on the right. |
| - | - Build a simple classifier using **only** the class means, and test it using the MNIST test data. (Note: this couldn't possibly be a good classifier!) That is, for each test data point $x_j$, you should compute the probability that $x_j$ came from a Gaussian centered at $\mu_k$, where $\mu_k$ is the expected value of class $k$ you computed in Part (1). Classify $x_j$ as coming from the most likely class. | + | - Build a simple classifier using **only** the class means, and test it using the MNIST test data. (Note: this couldn't possibly be a good classifier!) That is, for each test data point $x_j$, you should compute the probability that $x_j$ came from a Gaussian centered at $\mu_k$, where $\mu_k$ is the expected value of class $k$ you computed in Part (1). Classify $x_j$ as coming from the most likely class. //Question: does the variance of your kernel matter?// |
| - | - Build a more complex classifier using a full kernel density estimator. For each test data point $x_j$, you should calculate the probability that it belongs to class $k$. | + | - Build a more complex classifier using a full kernel density estimator. For each test data point $x_j$, you should calculate the probability that it belongs to class $k$. //Question: does the variance of your kernel matter?// |
| + | |||
| + | //Note: Part (3) will probably run slowly! Why? **To make everyone's life easier, only run your full KDE classifier on the first 1000 test points.**// | ||
| For Part (2) and Part (3) your notebook should report two things: | For Part (2) and Part (3) your notebook should report two things: | ||
| Line 18: | Line 20: | ||
| {{ :cs401r_w2016:lab5_confmat2.png?direct&300|}} | {{ :cs401r_w2016:lab5_confmat2.png?direct&300|}} | ||
| - | - The overall classification rate. For example, when I coded up Part 2, my classification error rate was 17.97%. When I coded up Part (3), my error rate was 3.80%. | + | - The overall classification rate. For example, when I coded up Part 2, my classification error rate was 17.97%. When I coded up Part (3), my error rate was <del>3.80%</del> 4.0%. (if you omit the factor of 1/2 in the exponent, you get 3.8%) |
| - A confusion matrix (see MLAPP pg. 183), or [[https://en.wikipedia.org/wiki/Confusion_matrix|this wikipedia article]]. A confusion matrix is a complete report of all of the different ways your classifier was wrong, and is much more informative than a single error rate; for example, a confusion matrix will report the number of times your classifier reported "3", when the true class was "8". You can report this confusion matrix either as a text table, or as an image. My confusion matrix is shown to the right; you can see that my classifier generally gets things right (the strong diagonal), but sometimes predicts "9" when the true class is "4" (for example). | - A confusion matrix (see MLAPP pg. 183), or [[https://en.wikipedia.org/wiki/Confusion_matrix|this wikipedia article]]. A confusion matrix is a complete report of all of the different ways your classifier was wrong, and is much more informative than a single error rate; for example, a confusion matrix will report the number of times your classifier reported "3", when the true class was "8". You can report this confusion matrix either as a text table, or as an image. My confusion matrix is shown to the right; you can see that my classifier generally gets things right (the strong diagonal), but sometimes predicts "9" when the true class is "4" (for example). | ||
| //What errors do you think are most likely for this lab?// | //What errors do you think are most likely for this lab?// | ||
| + | |||
| + | ---- | ||
| + | ====Extra credit:==== | ||
| + | |||
| + | Somewhere in the first 1000 training images is an outlier! Using the tools of kernel density estimation and anomaly detection, can you find it? (To get credit for this, you cannot manually look for the outlier, you must automatically detect it; your notebook should contain the code you used to do this.) | ||
| + | |||
| + | If so, have your notebook display an image with the outlier, along with the index of the outlier. | ||
| + | |||
| + | //**Note: if you find the outlier, please don't tell other students which one it is!**// | ||
| + | |||
| + | ---- | ||
| + | ====Grading standards:==== | ||
| + | |||
| + | |||
| + | Your notebook will be graded on the following: | ||
| + | |||
| + | * 10% Correct calculation of class means | ||
| + | * 5% Tidy and legible visualization of class means | ||
| + | * 20% Correct implementation of simple classifier | ||
| + | * 40% Correct implementation of full KDE classifier | ||
| + | * 15% Correct calculation of confusion matrix | ||
| + | * 10% Tidy and legible confusion matrix plots | ||
| + | |||
| + | * 10% Extra credit for outlier detection | ||
| ---- | ---- | ||
| ====Description:==== | ====Description:==== | ||
| + | |||
| For this lab, you will be experimenting with Kernel Density Estimators (see MLAPP 14.7.2). These are a simple, nonparametric alternative to Gaussian mixture models, but which form an important part of the machine learning toolkit. | For this lab, you will be experimenting with Kernel Density Estimators (see MLAPP 14.7.2). These are a simple, nonparametric alternative to Gaussian mixture models, but which form an important part of the machine learning toolkit. | ||
| Line 39: | Line 66: | ||
| - | The data that you will analyzing is the famous [[http://yann.lecun.com/exdb/mnist/|MNIST handwritten digits dataset]]. You can download some pre-processed MATLAB data files below: | + | The data that you will analyzing is the famous [[http://yann.lecun.com/exdb/mnist/|MNIST handwritten digits dataset]]. You can download some pre-processed MATLAB data files from the class Dropbox, or via direct links below: |
| - | [[http://hatch.cs.byu.edu/courses/stat_ml/mnist_train.mat|MNIST training data vectors and labels]] | + | [[https://www.dropbox.com/s/23vs1osykktxbqg/mnist_train.mat?dl=0|MNIST training data vectors and labels]] |
| - | [[http://hatch.cs.byu.edu/courses/stat_ml/mnist_test.mat|MNIST test data vectors and labels]] | + | [[https://www.dropbox.com/s/47dupql5jm9alc4/mnist_test.mat?dl=0|MNIST test data vectors and labels]] |
| These can be loaded using the scipy.io.loadmat function, as follows: | These can be loaded using the scipy.io.loadmat function, as follows: | ||
| Line 68: | Line 95: | ||
| <code python> | <code python> | ||
| import matplotlib.pyplot as plt | import matplotlib.pyplot as plt | ||
| - | plt.imshow( X.reshape(28,28).T, interpolation='nearest', cmap=matplotlib.cm.gray) | + | plt.imshow( X.reshape(28,28).T, interpolation='nearest', cmap="gray") |
| </code> | </code> | ||
cs401r_w2016/lab5.1452615239.txt.gz · Last modified: 2021/06/30 23:40 (external edit)
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
