-
Notifications
You must be signed in to change notification settings - Fork 36
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Tidied up code, added correlation model
- Loading branch information
Steve Fleming
committed
Aug 8, 2016
1 parent
b639a1b
commit 28b37ce
Showing
13 changed files
with
305 additions
and
71 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,122 @@ | ||
# Bayesian estimation of meta-d/d for group correlation between domains | ||
|
||
data { | ||
for (s in 1:nsubj) { | ||
# Type 1 counts for task 1 | ||
N[s,1] <- sum(counts1[s,1:nratings*2]) | ||
S[s,1] <- sum(counts1[s,(nratings*2)+1:nratings*4]) | ||
H[s,1] <- sum(counts1[s,(nratings*3)+1:nratings*4]) | ||
FA[s,1] <- sum(counts1[s,(nratings*2)+1:nratings*3]) | ||
M[s,1] <- sum(counts1[s,nratings+1:nratings*2]) | ||
CR[s,1] <- sum(counts1[s,1:nratings]) | ||
|
||
# Type 1 counts for task 2 | ||
N[s,2] <- sum(counts2[s,1:nratings*2]) | ||
S[s,2] <- sum(counts2[s,(nratings*2)+1:nratings*4]) | ||
H[s,2] <- sum(counts2[s,(nratings*3)+1:nratings*4]) | ||
FA[s,2] <- sum(counts2[s,(nratings*2)+1:nratings*3]) | ||
M[s,2] <- sum(counts2[s,nratings+1:nratings*2]) | ||
CR[s,2] <- sum(counts2[s,1:nratings]) | ||
} | ||
} | ||
|
||
model { | ||
for (s in 1:nsubj) { | ||
|
||
## TYPE 2 SDT MODEL (META-D) | ||
# Multinomial likelihood for response counts ordered as c(nR_S1,nR_S2) | ||
counts1[s,1:nratings] ~ dmulti(prT[s,1:nratings,1],CR[s,1]) | ||
counts1[s,nratings+1:nratings*2] ~ dmulti(prT[s,nratings+1:nratings*2,1],M[s,1]) | ||
counts1[s,(nratings*2)+1:nratings*3] ~ dmulti(prT[s,(nratings*2)+1:nratings*3,1],FA[s,1]) | ||
counts1[s,(nratings*3)+1:nratings*4] ~ dmulti(prT[s,(nratings*3)+1:nratings*4,1],H[s,1]) | ||
|
||
counts2[s,1:nratings] ~ dmulti(prT[s,1:nratings,2],CR[s,2]) | ||
counts2[s,nratings+1:nratings*2] ~ dmulti(prT[s,nratings+1:nratings*2,2],M[s,2]) | ||
counts2[s,(nratings*2)+1:nratings*3] ~ dmulti(prT[s,(nratings*2)+1:nratings*3,2],FA[s,2]) | ||
counts2[s,(nratings*3)+1:nratings*4] ~ dmulti(prT[s,(nratings*3)+1:nratings*4,2],H[s,2]) | ||
|
||
for (task in 1:2) { | ||
|
||
# Means of SDT distributions] | ||
mu[s,task] <- Mratio[s,task]*d1[s,task] | ||
S2mu[s,task] <- mu[s,task]/2 | ||
S1mu[s,task] <- -mu[s,task]/2 | ||
|
||
# Calculate normalisation constants | ||
C_area_rS1[s,task] <- phi(c1[s,task] - S1mu[s,task]) | ||
I_area_rS1[s,task] <- phi(c1[s,task] - S2mu[s,task]) | ||
C_area_rS2[s,task] <- 1-phi(c1[s,task] - S2mu[s,task]) | ||
I_area_rS2[s,task] <- 1-phi(c1[s,task] - S1mu[s,task]) | ||
|
||
# Get nC_rS1 probs | ||
pr[s,1,task] <- phi(cS1[s,1,task] - S1mu[s,task])/C_area_rS1[s,task] | ||
for (k in 1:nratings-2) { | ||
pr[s,k+1,task] <- (phi(cS1[s,k+1,task] - S1mu[s,task])-phi(cS1[s,k,task] - S1mu[s,task]))/C_area_rS1[s,task] | ||
} | ||
pr[s,nratings,task] <- (phi(c1[s,task] - S1mu[s,task])-phi(cS1[s,nratings-1,task] - S1mu[s,task]))/C_area_rS1[s,task] | ||
|
||
# Get nI_rS2 probs | ||
pr[s,nratings+1,task] <- ((1-phi(c1[s,task] - S1mu[s,task]))-(1-phi(cS2[s,1,task] - S1mu[s,task])))/I_area_rS2[s,task] | ||
for (k in 1:nratings-2) { | ||
pr[s,nratings+1+k,task] <- ((1-phi(cS2[s,k,task] - S1mu[s,task]))-(1-phi(cS2[s,k+1,task] - S1mu[s,task])))/I_area_rS2[s,task] | ||
} | ||
pr[s,nratings*2,task] <- (1-phi(cS2[s,nratings-1,task] - S1mu[s,task]))/I_area_rS2[s,task] | ||
|
||
# Get nI_rS1 probs | ||
pr[s,(nratings*2)+1, task] <- phi(cS1[s,1,task] - S2mu[s,task])/I_area_rS1[s,task] | ||
for (k in 1:nratings-2) { | ||
pr[s,(nratings*2)+1+k,task] <- (phi(cS1[s,k+1,task] - S2mu[s,task])-phi(cS1[s,k,task] - S2mu[s,task]))/I_area_rS1[s,task] | ||
} | ||
pr[s,nratings*3,task] <- (phi(c1[s,task] - S2mu[s,task])-phi(cS1[s,nratings-1,task] - S2mu[s,task]))/I_area_rS1[s,task] | ||
|
||
# Get nC_rS2 probs | ||
pr[s,(nratings*3)+1,task] <- ((1-phi(c1[s,task] - S2mu[s,task]))-(1-phi(cS2[s,1,task] - S2mu[s,task])))/C_area_rS2[s,task] | ||
for (k in 1:nratings-2) { | ||
pr[s,(nratings*3)+1+k,task] <- ((1-phi(cS2[s,k,task] - S2mu[s,task]))-(1-phi(cS2[s,k+1,task] - S2mu[s,task])))/C_area_rS2[s,task] | ||
} | ||
pr[s,nratings*4,task] <- (1-phi(cS2[s,nratings-1,task] - S2mu[s,task]))/C_area_rS2[s,task] | ||
|
||
# Avoid underflow of probabilities | ||
for (i in 1:nratings*4) { | ||
prT[s,i,task] <- ifelse(pr[s,i,task] < Tol, Tol, pr[s,i,task]) | ||
} | ||
|
||
# Specify ordered prior on criteria (bounded above and below by Type 1 c) | ||
for (j in 1:(nratings-1)) { | ||
cS1_raw[s,j,task] ~ dnorm(-mu_c2[task], lambda_c2[task]) | ||
cS2_raw[s,j,task] ~ dnorm(mu_c2[task], lambda_c2[task]) | ||
} | ||
cS1[s,1:nratings-1,task] <- sort(cS1_raw[s,1:nratings-1,task]) | ||
cS2[s,1:nratings-1,task] <- sort(cS2_raw[s,1:nratings-1,task]) | ||
|
||
Mratio[s,task] <- exp(logMratio[s,task]) | ||
|
||
} | ||
|
||
# Draw log(M)'s from bivariate Gaussian | ||
logMratio[s,1:2] ~ dmnorm(mu_logMratio[], TI[,]) | ||
|
||
} | ||
|
||
mu_c2[1] ~ dnorm(0, 0.01) | ||
mu_c2[2] ~ dnorm(0, 0.01) | ||
sigma_c2[1] ~ dnorm(0, 0.01) I(0, ) | ||
sigma_c2[2] ~ dnorm(0, 0.01) I(0, ) | ||
lambda_c2[1] <- pow(sigma_c2[1], -2) | ||
lambda_c2[2] <- pow(sigma_c2[2], -2) | ||
|
||
mu_logMratio[1] ~ dnorm(0, 1) | ||
mu_logMratio[2] ~ dnorm(0, 1) | ||
lambda_logMratio[1] ~ dgamma(0.001,0.001) | ||
lambda_logMratio[2] ~ dgamma(0.001,0.001) | ||
sigma_logMratio[1] <- 1/sqrt(lambda_logMratio[1]) | ||
sigma_logMratio[2] <- 1/sqrt(lambda_logMratio[2]) | ||
rho ~ dunif(-1,1) | ||
|
||
T[1,1] <- 1/lambda_logMratio[1] | ||
T[1,2] <- rho*sigma_logMratio[1]*sigma_logMratio[2] | ||
T[2,2] <- 1/lambda_logMratio[2] | ||
T[2,1] <- rho*sigma_logMratio[1]*sigma_logMratio[2] | ||
TI[1:2,1:2] <- inverse(T[1:2,1:2]) | ||
|
||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.