powered by
For a given prior graph, the two-step algorithm, including edge enrichment and pruning, is used to construct the model pool
modelset(data, lambda, P)
A n by p data frame of observations
n
p
Tuning parameter vector
Prior adjacency matrix
A list including all the candidate models in the model pool. Each model is represented by a p by p adjacency matrix
# NOT RUN { set.seed(1) d=simulate(n=100, p=100, m1 = 100, m2 = 30) data=d$data P=d$priornetwork lambda=exp(seq(-5,5,length=100)) candidates=modelset(data=data,lambda=lambda, P=P) # }
Run the code above in your browser using DataLab