Gaussian Discriminant Analysis
material thanks to Andrew Ng @Stanford
Gaussian Discriminant Analysis material thanks to Andrew Ng - - PowerPoint PPT Presentation
Gaussian Discriminant Analysis material thanks to Andrew Ng @Stanford Course Map / module3 module 3: generative methods LEARNING PERFORMANCE REPRESENTATION DATA PROBLEM CLUSTERING RAW DATA EVALUATION FEATURES EM algorithm artificial
material thanks to Andrew Ng @Stanford
RAW DATA artificial data spam data coin flips LABELS FEATURES SUPERVISED LEARNING likelihoods GDA naive bayes graphical models CLUSTERING EVALUATION ANALYSIS SELECTION DIMENSIONS DATA PROCESSING TUNING
DATA PROBLEM REPRESENTATION LEARNING PERFORMANCE
module 3: generative methods
EM algorithm
gaussian parameters estimation (mean, covariance)
simple variance
distribution to histogram (density or counts)
is controlled by mean and variance
maximizes likelihood of the data
P(x|µ, σ2) = normal(x, µ, σ2) = 1 σ √ 2π e− (x−µ)2
2σ2
log L = log
m
Y
i=1
P(x|µ, σ2) =
m
X
i=1
logP(x|µ, σ2)
distribution
independent variables)
distribution
1 1
0.6 0.6
2 2
distribution
distribution
variables