Difference between revisions of "10-601 Classification and K-NN"

From Cohen Courses
Jump to navigationJump to search
 
(8 intermediate revisions by 2 users not shown)
Line 3: Line 3:
 
=== Slides ===
 
=== Slides ===
  
−
* [http://www.cs.cmu.edu/~wcohen/10-601/classification-and-knn.pptx Slides in Powerpoint].
+
* Ziv's lecture: [http://www.cs.cmu.edu/~zivbj/classF14/classification.pdf Slides in pdf].
 +
 
 +
* William's lecture: [http://www.cs.cmu.edu/~wcohen/10-601/classification-and-knn.pptx Slides in Powerpoint], [http://www.cs.cmu.edu/~wcohen/10-601/classification-and-knn.pdf in PDF].
  
 
=== Readings ===
 
=== Readings ===
  
−
* Mitchell, Chapter 3.
+
* Mitchell, Chapters 1,2 and 8.
  
 
=== What You Should Know Afterward ===
 
=== What You Should Know Afterward ===
  
 
* What is the goal of classification
 
* What is the goal of classification
−
* Bayes decision boundary for classification
+
* What sorts of problems can be solved by reducing them to classification
−
* Is there an optimal classifier?
 
 
* What the K-NN algorithm is.
 
* What the K-NN algorithm is.
−
* What the computational properties of eager vs lazy learning are in general, and K-NN in specific.
 
−
* What decision boundary is defined by K-NN, and how it compares to decision boundaries of linear classifiers.
 
 
* How the value of K affects the tendency of K-NN to overfit or underfit data.
 
* How the value of K affects the tendency of K-NN to overfit or underfit data.
−
* (optional) probabilistic interpretation of KNN decisions
+
 
 +
* Optional:
 +
** Bayes decision boundary for classification
 +
** Is there an optimal classifier?
 +
** What decision boundary is defined by K-NN.
 +
** Probabilistic interpretation of KNN decisions

Latest revision as of 14:44, 17 September 2014

This a lecture used in the Syllabus for Machine Learning 10-601 in Fall 2014

Slides

Readings

  • Mitchell, Chapters 1,2 and 8.

What You Should Know Afterward

  • What is the goal of classification
  • What sorts of problems can be solved by reducing them to classification
  • What the K-NN algorithm is.
  • How the value of K affects the tendency of K-NN to overfit or underfit data.
  • Optional:
    • Bayes decision boundary for classification
    • Is there an optimal classifier?
    • What decision boundary is defined by K-NN.
    • Probabilistic interpretation of KNN decisions
Retrieved from "http://curtis.ml.cmu.edu/w/courses/index.php?title=10-601_Classification_and_K-NN&oldid=17131"