Top Banner
COMMINGLING ANALYSIS By : Jeff Berry
25

Presentation

Apr 13, 2017

Download

Documents

Jeffrey Berry
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Presentation

COMMINGLING ANALYSIS By : Jeff Berry

Page 2: Presentation

WHAT IT ISu1 u2 u3

q

sig

QTp

Dosage

Page 3: Presentation

ASSUMPTIONS* Families are independent

i.e. parents are independent

* QTp is normally distributed in each genotype

* Variance is the same across genotypes

Page 4: Presentation

ASSUMPTIONS

This is only for one person!

Page 5: Presentation

ASSUMPTIONS

This is only for one person!

Page 6: Presentation

ASSUMPTIONS

The goal is develop an algorithm that maximizes the log-likelihood for a given set of parameters

Page 7: Presentation

THE PROBLEMNull is True

*Governing Distribution of Pheno Is one Gaussian

Alternative is true

*Governing distribution of phenoIs a mixture of Gaussians

Hypothesis

Page 8: Presentation

How much different does it have to be to be significant?

VS

df = number of freely estimated parameters = 5-2 = 3

Page 9: Presentation

How much different does it have to be to be significant?

VS

df = number of freely estimated parameters = 5-2 = 3

Page 10: Presentation

METHODS• Hybrid EM-Grid Search

q u1 u2 u3 sigma

L()

E

M

Alternative Model

Page 11: Presentation

METHODS• Hybrid EM-Grid Search

u sigma

L()

E

M

Null Model

Page 12: Presentation

METHODS• Computational Intensity

I say approximately because it takes about four iterationsAt each step to converge to MLE.

ni := number of steps taken to maximize parameter i

Page 13: Presentation

MAIN.R

Page 14: Presentation

MAXIMIZE.R

Exact same idea for other parameters

Page 15: Presentation

INITIALIZATION OF PARAMS

Page 16: Presentation

NULLMODEL.R

Page 17: Presentation

ALTMODEL.R

Page 18: Presentation

COMPAREMODELS.R

Page 19: Presentation

OUTPUT

Page 20: Presentation

TIME REQUIREMENTS• About my machine

• 2.4 GHz Intel Core 2 Duo• 4 GB 667 MHz DDR2 SDRAM• Mac OS X 10.6.8

• Using R Studio

Page 21: Presentation

TIME REQUIREMENTS

0 200 400 600 800 1000 12000

100

200

300

400

500

600

Time vs nfams

Number of Families Simulated

Com

puta

tiona

l Tim

e (s

ec)

Stepsize=0.05Alternative is TRUE

Page 22: Presentation

TIME REQUIREMENTS Nfams = 90Alternative is TRUE

0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.1 0.110

5

10

15

20

25

30

35

40

45

50

Time vs Step-size

Step-Size for Grid Search

Com

puta

tiona

l Tim

e (s

ec)

Page 23: Presentation

LET’S TEST IT

output q u1 u2 u3 sigma nfams1 0.4 -1.34 0 1 0.1 75 alt2 0.34 -1.34 -0.5 1.3 0.15 75 alt3 0.27 1.5 1.43 1.6 0.2 150 null4 0.27 1.5 1.5 1.5 0.2 150 null

Page 24: Presentation

PERSPECTIVE Limitations• On my computer, it takes considerable time while nfams

gets moderately large. Similar to stepsize decreasing• Possible Solution: Coarse search, then fine search

• The starting conditions assumptions can be violated in real data• Possible Solution: Look at your data! Then adjust starting

values accordingly. • Strictly additive model with HWE

• Possible Solution: ??? • If assumptions are reasonably met, I would feel

comfortable using these functions

Page 25: Presentation

ACKNOWLEDGEMENTS Thanks to:• Dr. Province and Dr. Kraja• All lecturers• HSG and MSIBS classmates