DOC PREVIEW
CMU CS 10701 - lecture

This preview shows page 1-2-3-4-5 out of 15 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 15 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 15 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 15 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 15 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 15 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 15 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

1 Machine Learning 10-701 Tom M. Mitchell Machine Learning Department Carnegie Mellon University January 25, 2011 Today: • Naïve Bayes • discrete-valued Xi’s • Document classification • Gaussian Naïve Bayes • real-valued Xi’s • Brain image classification • Form of decision surfaces Readings: Required: • Mitchell: “Naïve Bayes and Logistic Regression” (available on class website) Optional • Bishop 1.2.4 • Bishop 4.2 Naïve Bayes in a Nutshell Bayes rule: Assuming conditional independence among Xi’s: So, classification rule for Xnew = < X1, …, Xn > is:2 Another way to view Naïve Bayes (Boolean Y): Decision rule: is this quantity greater or less than 1? P(S | D,G,M)3 Naïve Bayes: classifying text documents • Classify which emails are spam? • Classify which emails promise an attachment? How shall we represent text documents for Naïve Bayes? Learning to classify documents: P(Y|X) • Y discrete valued. – e.g., Spam or not • X = <X1, X2, … Xn> = document • Xi is a random variable describing…4 Learning to classify documents: P(Y|X) • Y discrete valued. – e.g., Spam or not • X = <X1, X2, … Xn> = document • Xi is a random variable describing… Answer 1: Xi is boolean, 1 if word i is in document, else 0 e.g., Xpleased = 1 Issues? Learning to classify documents: P(Y|X) • Y discrete valued. – e.g., Spam or not • X = <X1, X2, … Xn> = document • Xi is a random variable describing… Answer 2: • Xi represents the ith word position in document • X1 = “I”, X2 = “am”, X3 = “pleased” • and, let’s assume the Xi are iid (indep, identically distributed)5 Learning to classify document: P(Y|X) the “Bag of Words” model • Y discrete valued. e.g., Spam or not • X = <X1, X2, … Xn> = document • Xi are iid random variables. Each represents the word at its position i in the document • Generating a document according to this distribution = rolling a 50,000 sided die, once for each word position in the document • The observed counts for each word follow a ??? distribution Multinomial Distribution6 Multinomial Bag of Words aardvark 0 about 2 all 2 Africa 1 apple 0 anxious 0 ... gas 1 ... oil 1 … Zaire 0 MAP estimates for bag of words Map estimate for multinomial What β’s should we choose?7 Naïve Bayes Algorithm – discrete Xi • Train Naïve Bayes (examples) for each value yk! estimate for each value xij of each attribute Xi! estimate • Classify (Xnew) prob that word xij appears in position i, given Y=yk * Additional assumption: word probabilities are position independent8 For code and data, see www.cs.cmu.edu/~tom/mlbook.html click on “Software and Data” What if we have continuous Xi ? Eg., image classification: Xi is real-valued ith pixel9 What if we have continuous Xi ? Eg., image classification: Xi is real-valued ith pixel Naïve Bayes requires P(Xi | Y=yk), but Xi is real (continuous) Common approach: assume P(Xi | Y=yk) follows a Normal (Gaussian) distribution Gaussian Distribution (also called “Normal”) p(x) is a probability density function, whose integral (not sum) is 110 What if we have continuous Xi ? Gaussian Naïve Bayes (GNB): assume Sometimes assume variance • is independent of Y (i.e., σi), • or independent of Xi (i.e., σk) • or both (i.e., σ) • Train Naïve Bayes (examples) for each value yk! estimate* for each attribute Xi estimate • class conditional mean , variance • Classify (Xnew) Gaussian Naïve Bayes Algorithm – continuous Xi (but still discrete Y) * probabilities must sum to 1, so need estimate only n-1 parameters...11 Estimating Parameters: Y discrete, Xi continuous Maximum likelihood estimates: !jth training example δ()=1 if (Yj=yk) else 0 ith feature kth class How many parameters must we estimate for Gaussian Naïve Bayes if Y has k possible values, X=<X1, … Xn>?12 What is form of decision surface for Gaussian Naïve Bayes classifier? eg., if we assume attributes have same variance, indep of Y ( ) GNB Example: Classify a person’s cognitive state, based on brain image • reading a sentence or viewing a picture? • reading the word describing a “Tool” or “Building”? • answering the question, or getting confused?13 Y is the mental state (reading “house” or “bottle”) Xi are the voxel activities, this is a plot of the µ’s defining P(Xi | Y=“bottle”) fMRI activation high below average average Mean activations over all training examples for Y=“bottle” Classification task: is person viewing a “tool” or “building”? statistically significant p<0.05 Classification accuracy14 Where is information encoded in the brain? Accuracies of cubical 27-voxel classifiers centered at each significant voxel [0.7-0.8] Naïve Bayes: What you should know • Designing classifiers based on Bayes rule • Conditional independence – What it is – Why it’s important • Naïve Bayes assumption and its consequences – Which (and how many) parameters must be estimated under different generative models (different forms for P(X|Y) ) • and why this matters • How to train Naïve Bayes classifiers – MLE and MAP estimates – with discrete and/or continuous inputs Xi15 Questions to think about: • Can you use Naïve Bayes for a combination of discrete and real-valued Xi? • How can we easily model just 2 of n attributes as dependent? • What does the decision surface of a Naïve Bayes classifier look like? • How would you select a subset of


View Full Document

CMU CS 10701 - lecture

Documents in this Course
lecture

lecture

12 pages

lecture

lecture

17 pages

HMMs

HMMs

40 pages

lecture

lecture

15 pages

lecture

lecture

20 pages

Notes

Notes

10 pages

Notes

Notes

15 pages

Lecture

Lecture

22 pages

Lecture

Lecture

13 pages

Lecture

Lecture

24 pages

Lecture9

Lecture9

38 pages

lecture

lecture

26 pages

lecture

lecture

13 pages

Lecture

Lecture

5 pages

lecture

lecture

18 pages

lecture

lecture

22 pages

Boosting

Boosting

11 pages

lecture

lecture

16 pages

lecture

lecture

20 pages

Lecture

Lecture

20 pages

Lecture

Lecture

39 pages

Lecture

Lecture

14 pages

Lecture

Lecture

18 pages

Lecture

Lecture

13 pages

Exam

Exam

10 pages

Lecture

Lecture

27 pages

Lecture

Lecture

15 pages

Lecture

Lecture

24 pages

Lecture

Lecture

16 pages

Lecture

Lecture

23 pages

Lecture6

Lecture6

28 pages

Notes

Notes

34 pages

lecture

lecture

15 pages

Midterm

Midterm

11 pages

lecture

lecture

11 pages

lecture

lecture

23 pages

Boosting

Boosting

35 pages

Lecture

Lecture

49 pages

Lecture

Lecture

22 pages

Lecture

Lecture

16 pages

Lecture

Lecture

18 pages

Lecture

Lecture

35 pages

lecture

lecture

22 pages

lecture

lecture

24 pages

Midterm

Midterm

17 pages

exam

exam

15 pages

Lecture12

Lecture12

32 pages

lecture

lecture

19 pages

Lecture

Lecture

32 pages

boosting

boosting

11 pages

pca-mdps

pca-mdps

56 pages

bns

bns

45 pages

mdps

mdps

42 pages

svms

svms

10 pages

Notes

Notes

12 pages

lecture

lecture

42 pages

lecture

lecture

29 pages

Lecture

Lecture

12 pages

Lecture

Lecture

24 pages

Lecture

Lecture

22 pages

Midterm

Midterm

5 pages

mdps-rl

mdps-rl

26 pages

Load more
Download lecture
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view lecture and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view lecture 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?