531f10EM2 - STAT 531: EM algorithm HM Kim Department of...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: STAT 531: EM algorithm HM Kim Department of Mathematics and Statistics University of Calgary Fall 2010 1/19 Applications filling in missing data in samples estimating parameters of finite mixtures discovering the value of latent variables so as to maximize the likelihood of the observed data (distribution). Fall 2010 2/19 EM algorithm Let ( t ) denote the estimate on the t th step. To complete the estimate on the ( t +1) th step do: Expectation Step: Compute Q ( | ( t ) , x ) = E [log p ( | x , z ) | ( t ) , x ] . Maximization Step: Let ( t +1) = argmax Q ( | ( t ) , x ) Fall 2010 3/19 , Example : The likelihood associated with the mixture model 1 4 N ( 1 , 1)+ 3 4 N ( 2 , 1) is bimodal. A simulated sample of 400 observations from this mixture with 1 = 0 and 2 = 2 . 5, where = ( 1 , 2 ). Introduce a vector ( z 1 , , z n ) { , 1 } n such that P ( Z i = 1) = 1 4 and P ( Z i = 0) = 3 4 X i | Z i = 1 N ( 1 , 1) and X i | Z i = 0 N ( 2 , 1) p = i ; z i =1 f 1 ( x i ) i ; z i =0 f 2 ( x i ) log p = z i =1 log f 1 ( x i )+ z i =0 log f 2 ( x i ) Fall 2010 4/19 log p = n i =1 [ z i log f 1 ( x i )+(1- z i )log f 2 ( x i )] E [log p | , x ] = n i =1 [ E ( Z i | , x )log f 1 ( x i )+ E (1- Z i | , x )log f 2 ( x i )] where f 1 ( x i ) = ( x i- 1 ) = 1 2 exp- ( x i- 1 ) 2 2 f 2 ( x 1 ) = ( x i- 2 ) = 1 2 exp- ( x i- 2 ) 2 2 . Therefore, Q ( | ( t ) , x ) =- 1 2 [( x i- 1 ) 2 E ( Z i | ( t ) , x )+( x i- 2 ) 2 E (1- Z i | ( t ) , x )] Fall 2010 5/19 The joint pdf of Z and X is f ( z i , x i ) = [ z i f 1 ( x )+(1- z i ) f 2 ( x i )] 1 4 z i 3 4 1- z i The marginal pdf of...
View Full Document

This note was uploaded on 02/04/2011 for the course STAT 531 taught by Professor Gaborlukacs during the Spring '11 term at Manitoba.

Page1 / 19

531f10EM2 - STAT 531: EM algorithm HM Kim Department of...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online