| Title: | Graphical Interaction Models |
|---|---|
| Description: | Provides the following types of models: Models for contingency tables (i.e. log-linear models) Graphical Gaussian models for multivariate normal data (i.e. covariance selection models) Mixed interaction models. Documentation about 'gRim' is provided by vignettes included in this package and the book by Højsgaard, Edwards and Lauritzen (2012, <doi:10.1007/978-1-4614-2299-0>); see 'citation("gRim")' for details. |
| Authors: | Søren Højsgaard [aut, cre] |
| Maintainer: | Søren Højsgaard <[email protected]> |
| License: | GPL (>= 2) |
| Version: | 0.3.4 |
| Built: | 2024-11-15 06:53:33 UTC |
| Source: | CRAN |
CGstats provides what corresponds to calling
cow.wt on different strata of data where the strata are defined by
the combinations of factors in data.
CGstats(object, varnames = NULL, homogeneous = TRUE, simplify = TRUE)CGstats(object, varnames = NULL, homogeneous = TRUE, simplify = TRUE)
object |
A dataframe. |
varnames |
Names of variables to be used. |
homogeneous |
Logical; if TRUE a common covariance matrix is reported. |
simplify |
Logical; if TRUE the result will be presented in a simpler form. |
A list whose form depends on the type of input data and the varnames.
Søren Højsgaard, [email protected]
data(milkcomp) # milkcomp <- subset(milkcomp, (treat %in% c("a", "b")) & (lactime %in% c("t1", "t2"))) # milkcomp <- milkcomp[,-1] # milkcomp$treat <- factor(milkcomp$treat) # milkcomp$lactime <- factor(milkcomp$lactime) CGstats(milkcomp) CGstats(milkcomp, c(1, 2)) CGstats(milkcomp, c("lactime", "treat")) CGstats(milkcomp, c(3, 4)) CGstats(milkcomp, c("fat", "protein")) CGstats(milkcomp, c(2, 3, 4), simplify=FALSE) CGstats(milkcomp, c(2, 3, 4), homogeneous=FALSE) CGstats(milkcomp, c(2, 3, 4), simplify=FALSE, homogeneous=FALSE)data(milkcomp) # milkcomp <- subset(milkcomp, (treat %in% c("a", "b")) & (lactime %in% c("t1", "t2"))) # milkcomp <- milkcomp[,-1] # milkcomp$treat <- factor(milkcomp$treat) # milkcomp$lactime <- factor(milkcomp$lactime) CGstats(milkcomp) CGstats(milkcomp, c(1, 2)) CGstats(milkcomp, c("lactime", "treat")) CGstats(milkcomp, c(3, 4)) CGstats(milkcomp, c("fat", "protein")) CGstats(milkcomp, c(2, 3, 4), simplify=FALSE) CGstats(milkcomp, c(2, 3, 4), homogeneous=FALSE) CGstats(milkcomp, c(2, 3, 4), simplify=FALSE, homogeneous=FALSE)
Test for conditional independence in a contingency table represented as an array.
ciTest_table( x, set = NULL, statistic = "dev", method = "chisq", adjust.df = TRUE, slice.info = TRUE, L = 20, B = 200, ... )ciTest_table( x, set = NULL, statistic = "dev", method = "chisq", adjust.df = TRUE, slice.info = TRUE, L = 20, B = 200, ... )
x |
An array of counts with named dimnames. |
set |
A specification of the test to be made. The tests are of the form u
and v are independent condionally on S where u and v are variables and S
is a set of variables. See 'details' for details about specification of
|
statistic |
Possible choices of the test statistic are |
method |
Method of evaluating the test statistic. Possible choices are
|
adjust.df |
Logical. Should degrees of freedom be adjusted for sparsity? |
slice.info |
Logical. Should slice info be stored in the output? |
L |
Number of extreme cases as stop criterion if method is
|
B |
Number (maximum) of simulations to make if method is
|
... |
Additional arguments. |
set can be 1) a vector or 2) a right-hand sided formula in
which variables are separated by '+'. In either case, it is tested if the
first two variables in the set are conditionally independent given
the remaining variables in set. (Notice an abuse of the '+'
operator in the right-hand sided formula: The order of the variables does
matter.)
If set is NULL then it is tested whether the first two
variables are conditionally independent given the remaining variables.
An object of class citest (which is a list).
Søren Højsgaard, [email protected]
ciTest, ciTest_df,
ciTest_mvn, chisq.test
data(lizard) ## lizard is has named dimnames names( dimnames( lizard )) ## checked with is.named.array( lizard ) ## Testing for conditional independence: # the following are all equivalent: ciTest(lizard, set=~diam + height + species) # ciTest(lizard, set=c("diam", "height", "species")) # ciTest(lizard, set=1:3) # ciTest(lizard) # (The latter because the names in lizard are as given above.) ## Testing for marginal independence ciTest(lizard, set=~diam + height) ciTest(lizard, set=1:2) ## Getting slice information: ciTest(lizard, set=c("diam", "height", "species"), slice.info=TRUE)$slice ## Do Monte Carlo test instead of usual likelihood ratio test. Different # options: # 1) Do B*10 simulations divided equally over each slice: ciTest(lizard, set=c("diam", "height", "species"), method="mc", B=400) # 2) Do at most B*10 simulations divided equally over each slice, but stop # when at most L extreme values are found ciTest(lizard, set=c("diam", "height", "species"), method="smc", B=400)data(lizard) ## lizard is has named dimnames names( dimnames( lizard )) ## checked with is.named.array( lizard ) ## Testing for conditional independence: # the following are all equivalent: ciTest(lizard, set=~diam + height + species) # ciTest(lizard, set=c("diam", "height", "species")) # ciTest(lizard, set=1:3) # ciTest(lizard) # (The latter because the names in lizard are as given above.) ## Testing for marginal independence ciTest(lizard, set=~diam + height) ciTest(lizard, set=1:2) ## Getting slice information: ciTest(lizard, set=c("diam", "height", "species"), slice.info=TRUE)$slice ## Do Monte Carlo test instead of usual likelihood ratio test. Different # options: # 1) Do B*10 simulations divided equally over each slice: ciTest(lizard, set=c("diam", "height", "species"), method="mc", B=400) # 2) Do at most B*10 simulations divided equally over each slice, but stop # when at most L extreme values are found ciTest(lizard, set=c("diam", "height", "species"), method="smc", B=400)
Test for conditional independence in a dataframe.
ciTest_df(x, set = NULL, ...)ciTest_df(x, set = NULL, ...)
x |
A dataframe. |
set |
A specification of the test to be made. The tests are of
the form u and v are independent condionally on S where u and v
are variables and S is a set of variables. See 'details' for
details about specification of |
... |
Additional arguments. |
set can be 1) a vector or 2) a right-hand sided formula in
which variables are separated by '+'. In either case, it is tested
if the first two variables in the set are conditionally
independent given the remaining variables in set. (Notice
an abuse of the '+' operator in the right-hand sided formula: The
order of the variables does matter.)
If set is NULL then it is tested whether the first two
variables are conditionally independent given the remaining variables.
If set consists only of factors then x[,set] is converted to a
contingency table and the test is made in this table using
ciTest_table().
If set consists only of numeric values and integers then
x[,set] is converted to a list with components cov and
n.obs by calling cov.wt(x[,set], method='ML'). This list is
then passed on to ciTest_mvn() which makes the test.
An object of class citest (which is a list).
Søren Højsgaard, [email protected]
ciTest, ciTest_table,
ciTest_mvn, chisq.test
data(milkcomp1) ciTest(milkcomp1, set=~tre + fat + pro) ciTest_df(milkcomp1, set=~tre + fat + pro)data(milkcomp1) ciTest(milkcomp1, set=~tre + fat + pro) ciTest_df(milkcomp1, set=~tre + fat + pro)
Generic function for conditional independence test. Specializes to specific types of data.
ciTest(x, set = NULL, ...)ciTest(x, set = NULL, ...)
x |
An object for which a test for conditional independence is to be
made. See 'details' for valid types of |
set |
A specification of the test to be made. The tests are of the form
u and v are independent condionally on S where u and v are variables and
S is a set of variables. See 'details' for details about specification of
|
... |
Additional arguments to be passed on to other methods. |
x can be
a table (an array). In this case ciTest_table is called.
a dataframe whose columns are numerics and factors. In this
case ciTest_df is called.
a list with components cov and n.obs. In this
case ciTest_mvn is called.
set can be
a vector,
a right-hand sided formula in which variables are separated by '+'.
In either case, it is tested if the first two variables in the
set are conditionally independent given the remaining
variables in set. (Notice an abuse of the '+' operator in
the right-hand sided formula: The order of the variables does
matter.)
An object of class citest (which is a list).
Søren Højsgaard, [email protected]
ciTest_table,
ciTest_df,
ciTest_mvn,
chisq.test
## contingency table: data(reinis) ## dataframe with only numeric variables: data(carcass) ## dataframe with numeric variables and factors: data(milkcomp1) ciTest(cov.wt(carcass, method='ML'), set=~Fat11 + Meat11 + Fat12) ciTest(reinis, set=~smo + phy + sys) ciTest(milkcomp1, set=~tre + fat + pro)## contingency table: data(reinis) ## dataframe with only numeric variables: data(carcass) ## dataframe with numeric variables and factors: data(milkcomp1) ciTest(cov.wt(carcass, method='ML'), set=~Fat11 + Meat11 + Fat12) ciTest(reinis, set=~smo + phy + sys) ciTest(milkcomp1, set=~tre + fat + pro)
Test for conditional independence in the multivariate normal distribution.
ciTest_mvn(x, set = NULL, statistic = "DEV", ...)ciTest_mvn(x, set = NULL, statistic = "DEV", ...)
x |
A list with elements |
set |
A specification of the test to be made. The tests are of
the form u and v are independent condionally on S where u and v
are variables and S is a set of variables. See 'details' for
details about specification of |
statistic |
The test statistic to be used, valid choices are
|
... |
Additional arguments |
set can be 1) a vector or 2) a right-hand sided formula in
which variables are separated by '+'. In either case, it is tested
if the first two variables in the set are conditionally
independent given the remaining variables in set. (Notice
an abuse of the '+' operator in the right-hand sided formula: The
order of the variables does matter.)
If set is NULL then it is tested whether the first
two variables are conditionally independent given the remaining
variables.
x must be a list with components cov and n.obs
such as returned by calling cov.wt( , method='ML') on a
dataframe.
An object of class citest (which is a list).
Søren Højsgaard, [email protected]
ciTest, ciTest_table,
ciTest_df, ciTest_mvn,
chisq.test
data(carcass) ciTest(cov.wt(carcass, method='ML'), set=~Fat11 + Meat11 + Fat12) ciTest_mvn(cov.wt(carcass, method='ML'), set=~Fat11 + Meat11 + Fat12)data(carcass) ciTest(cov.wt(carcass, method='ML'), set=~Fat11 + Meat11 + Fat12) ciTest_mvn(cov.wt(carcass, method='ML'), set=~Fat11 + Meat11 + Fat12)
The function computes tests of independence of two variables, say u and v, given a set of variables, say S. The deviance, Wilcoxon, Kruskal-Wallis and Jonkheere-Terpstra tests are supported. Asymptotic and Monte Carlo p-values are computed.
ciTest_ordinal(x, set = NULL, statistic = "dev", N = 0, ...)ciTest_ordinal(x, set = NULL, statistic = "dev", N = 0, ...)
x |
A dataframe or table. |
set |
The variable set (u,v,S), given either as an integer vector of the column numbers of a dataframe or dimension numbers of a table, or as a character vector with the corresponding variable or dimension names. |
statistic |
Either "deviance", "wilcoxon", "kruskal" or "jt". |
N |
The number of Monte Carlo samples. If N<=0 then Monte Carlo p-values are not computed. |
... |
Additional arguments, currently not used |
The deviance test is appropriate when u and v are nominal; Wilcoxon, when u is binary and v is ordinal; Kruskal-Wallis, when u is nominal and v is ordinal; Jonckheere-Terpstra, when both u and v are ordinal.
A list including the test statistic, the asymptotic p-value and, when computed, the Monte Carlo p-value.
P |
Asymptotic p-value |
montecarlo.P |
Monte Carlo p-value |
Flaminia Musella, David Edwards, Søren Højsgaard, [email protected]
See Edwards D. (2000), "Introduction to Graphical Modelling", 2nd ed., Springer-Verlag, pp. 130-153.
library(gRim) data(dumping, package="gRbase") ciTest_ordinal(dumping, c(2,1,3), stat="jt", N=1000) ciTest_ordinal(dumping, c("Operation", "Symptom", "Centre"), stat="jt", N=1000) ciTest_ordinal(dumping, ~Operation + Symptom + Centre, stat="jt", N=1000) data(reinis) ciTest_ordinal(reinis, c(1,3,4:6), N=1000) # If data is a dataframe dd <- as.data.frame(dumping) ncells <- prod(dim(dumping)) ff <- dd$Freq idx <- unlist(mapply(function(i,n) rep(i,n),1:ncells,ff)) dumpDF <- dd[idx, 1:3] rownames(dumpDF) <- 1:NROW(dumpDF) ciTest_ordinal(dumpDF, c(2,1,3), stat="jt", N=1000) ciTest_ordinal(dumpDF, c("Operation","Symptom","Centre"), stat="jt", N=1000) ciTest_ordinal(dumpDF, ~ Operation + Symptom + Centre, stat="jt", N=1000)library(gRim) data(dumping, package="gRbase") ciTest_ordinal(dumping, c(2,1,3), stat="jt", N=1000) ciTest_ordinal(dumping, c("Operation", "Symptom", "Centre"), stat="jt", N=1000) ciTest_ordinal(dumping, ~Operation + Symptom + Centre, stat="jt", N=1000) data(reinis) ciTest_ordinal(reinis, c(1,3,4:6), N=1000) # If data is a dataframe dd <- as.data.frame(dumping) ncells <- prod(dim(dumping)) ff <- dd$Freq idx <- unlist(mapply(function(i,n) rep(i,n),1:ncells,ff)) dumpDF <- dd[idx, 1:3] rownames(dumpDF) <- 1:NROW(dumpDF) ciTest_ordinal(dumpDF, c(2,1,3), stat="jt", N=1000) ciTest_ordinal(dumpDF, c("Operation","Symptom","Centre"), stat="jt", N=1000) ciTest_ordinal(dumpDF, ~ Operation + Symptom + Centre, stat="jt", N=1000)
Specification of graphical Gaussian model. The 'c' in
the name cmod refers to that it is a (graphical) model
for 'c'ontinuous variables
cmod( formula, data, marginal = NULL, fit = TRUE, maximal_only = FALSE, details = 0 )cmod( formula, data, marginal = NULL, fit = TRUE, maximal_only = FALSE, details = 0 )
formula |
Model specification in one of the following forms: 1) a right-hand sided formula, 2) as a list of generators. Notice that there are certain model specification shortcuts, see Section 'details' below. |
data |
Data in one of the following forms: 1) A dataframe or
2) a list with elements |
marginal |
Should only a subset of the variables be used in connection with the model specification shortcuts. |
fit |
Should the model be fitted. |
maximal_only |
Should only maximal generators be retained. |
details |
Control the amount of output; for debugging purposes. |
The independence model can be specified as ~.^1 and
the saturated model as ~.^.. The marginal
argument can be used for specifying the independence or
saturated models for only a subset of the variables.
An object of class cModel (a list)
Søren Højsgaard, [email protected]
## Graphical Gaussian model data(carcass) cm1 <- cmod(~ .^., data=carcass) ## Stepwise selection based on BIC cm2 <- backward(cm1, k=log(nrow(carcass))) ## Stepwise selection with fixed edges cm3 <- backward(cm1, k=log(nrow(carcass)), fixin=matrix(c("LeanMeat", "Meat11", "Meat12", "Meat13", "LeanMeat", "Fat11", "Fat12", "Fat13"), ncol=2))## Graphical Gaussian model data(carcass) cm1 <- cmod(~ .^., data=carcass) ## Stepwise selection based on BIC cm2 <- backward(cm1, k=log(nrow(carcass))) ## Stepwise selection with fixed edges cm3 <- backward(cm1, k=log(nrow(carcass)), fixin=matrix(c("LeanMeat", "Meat11", "Meat12", "Meat13", "LeanMeat", "Fat11", "Fat12", "Fat13"), ncol=2))
Coerce models to different representations
as_emat2cq(emat, nvar = NULL) as_emat_complement(emat, nvar) as_emat2amat(emat, d) as_emat2elist(emat) as_elist2emat(elist) as_glist2emat(glist) as_glist2cq(glist) as_glist2graph(glist, d) as_glist2igraph(glist, d) as_emat2graph(emat, d) as_emat2igraph(emat, d) as_amat2emat(amat, eps = 1e-04) as_emat2glist(emat) as_glist2out_edges(glist) as_K2amat(K, eps = 1e-04) as_K2graph(K) as_sparse(K)as_emat2cq(emat, nvar = NULL) as_emat_complement(emat, nvar) as_emat2amat(emat, d) as_emat2elist(emat) as_elist2emat(elist) as_glist2emat(glist) as_glist2cq(glist) as_glist2graph(glist, d) as_glist2igraph(glist, d) as_emat2graph(emat, d) as_emat2igraph(emat, d) as_amat2emat(amat, eps = 1e-04) as_emat2glist(emat) as_glist2out_edges(glist) as_K2amat(K, eps = 1e-04) as_K2graph(K) as_sparse(K)
emat |
Edge matrix (2 x p) |
nvar |
Number of variables |
d |
Number of columns in output. |
elist |
Edge list (list of pairs) |
glist |
Generator list |
amat |
Adjacency matrix |
eps |
Small number glist <- list(c(1,2,3),c(2,3,4),c(5,6)) em <- as_glist2emat(glist) am <- as_emat2amat(em, d=6) ig <- as_emat2igraph(em) el <- as_emat2elist(em) igraph::max_cliques(ig) as_emat2cq(em, 6) as_emat_complement(em, 6) |
K |
Concentration matrix |
Edge matrix operations needed for ips algorithms
emat_compare(emat1, emat2) emat_complement(emat1, emat2) emat_sort(emat1) order_rows(emat)emat_compare(emat1, emat2) emat_complement(emat1, emat2) emat_sort(emat1) order_rows(emat)
emat, emat1, emat2
|
Edge matrix (a 2 x p matrix) |
An emat with p edges is represented by a 2 x p matrix.
These functions may well be removed from the package in future relases
Søren Højsgaard, [email protected]
emat1 <- model_saturated(3:4, type="emat") emat2 <- model_saturated(1:4, type="emat") emat_complement(emat1, emat2) emat3 <- model_saturated(2:4, type="emat") emat_compare(emat1, emat3)emat1 <- model_saturated(3:4, type="emat") emat2 <- model_saturated(1:4, type="emat") emat_complement(emat1, emat2) emat3 <- model_saturated(2:4, type="emat") emat_compare(emat1, emat3)
Fast computation of covariance / correlation matrix
fast_cov(x, center = TRUE, scale = TRUE)fast_cov(x, center = TRUE, scale = TRUE)
x |
a numeric matrix(like object). |
center, scale
|
Should columns in x be centered and/or scaled |
Fit Gaussian graphical models using various algorithms.
fit_ggm_grips( S, formula = NULL, nobs, K = NULL, maxit = 10000L, eps = 0.01, convcrit = 1, aux = list(), method = "ncd", print = 0 )fit_ggm_grips( S, formula = NULL, nobs, K = NULL, maxit = 10000L, eps = 0.01, convcrit = 1, aux = list(), method = "ncd", print = 0 )
S |
Sample covariance matrix. |
formula |
Generators of model; a list of integer vectors or a 2 x p matrix of integers. |
nobs |
Number of observations |
K |
Initial value of concentration matrix. |
maxit |
Maximum number of iterations. |
eps |
Convergence criterion. |
convcrit |
Convergence criterions. See section |
aux |
A list of form name=value. |
method |
Either |
print |
Should output from fitting be printed? |
Convergence criterion:
1: max absolute difference between S and Sigmahat on edges.
2: difference in log likelihood divided by number of parameters in the model (number of edges + number of nodes) between successive iterations.
3: computed duality gap may turn negative due to rounding error, so its absolute value is returned. This still provides upper bound on error of likelihood function.
Methods:
"ncd": Neighbour coordinate descent.
"covips": IPS based on working with the covariance matrix.
"conips": IPS based on working with the concentration matrix.
ncd is very fast but may fail to converge in rare cases. Both covips and conips are guaranteed to converge provided the maximum likelihood estimate exists, and covips are considerably faster than conips.
Søren Højsgaard, [email protected]
options("digits"=3) data(math, package="gRbase") S <- cov(math) nobs <- nrow(math) gl <- list(1:3, 3:5) em <- matrix(c(1,2, 2,3, 1,3, 3,4, 3,5, 4,5), nrow=2) EPS = 1e-2 fit_cov = fit_ggm_grips(S, gl, nobs=nobs, eps=EPS, method="cov") fit_con = fit_ggm_grips(S, gl, nobs=nobs, eps=EPS, method="con") fit_ncd = fit_ggm_grips(S, gl, nobs=nobs, eps=EPS, method="ncd") K <- solve(S) (fit_con$K - K) |> abs() |> max() (fit_cov$K - K) |> abs() |> max() (fit_ncd$K - K) |> abs() |> max()options("digits"=3) data(math, package="gRbase") S <- cov(math) nobs <- nrow(math) gl <- list(1:3, 3:5) em <- matrix(c(1,2, 2,3, 1,3, 3,4, 3,5, 4,5), nrow=2) EPS = 1e-2 fit_cov = fit_ggm_grips(S, gl, nobs=nobs, eps=EPS, method="cov") fit_con = fit_ggm_grips(S, gl, nobs=nobs, eps=EPS, method="con") fit_ncd = fit_ggm_grips(S, gl, nobs=nobs, eps=EPS, method="ncd") K <- solve(S) (fit_con$K - K) |> abs() |> max() (fit_cov$K - K) |> abs() |> max() (fit_ncd$K - K) |> abs() |> max()
Models are represented in various forms
emat_saturated_model(index) model_saturated(index, type = "emat", nms = NULL) model_random_tree(index, prob = 0, type = "emat", nms = NULL) model_rectangular_grid(dim, type = "emat", nms = NULL) model_line(index, type = "emat", nms = NULL) model_star(index, type = "emat", nms = NULL) model_loop(index, prob = 0, type = "emat", nms = NULL) model_random(index, prob = 0.1, type = "emat", nms = NULL)emat_saturated_model(index) model_saturated(index, type = "emat", nms = NULL) model_random_tree(index, prob = 0, type = "emat", nms = NULL) model_rectangular_grid(dim, type = "emat", nms = NULL) model_line(index, type = "emat", nms = NULL) model_star(index, type = "emat", nms = NULL) model_loop(index, prob = 0, type = "emat", nms = NULL) model_random(index, prob = 0.1, type = "emat", nms = NULL)
index |
A vector of integers |
type |
Output type. |
nms |
Names of variables. |
prob |
Probability of any edge being present. |
dim |
A vector with dimensions |
Genrate matrix of N(0, 1) variables
generate_n01(n.obs, nvar, seed = 2022)generate_n01(n.obs, nvar, seed = 2022)
n.obs |
Number of rows |
nvar |
Number of columns |
seed |
Seed for random number generator |
Returns the edges of a graph (or edges not in a graph) where the graph can be either an igraph object, a list of generators or an adjacency matrix.
getEdges(object, type = "unrestricted", ingraph = TRUE, discrete = NULL, ...)getEdges(object, type = "unrestricted", ingraph = TRUE, discrete = NULL, ...)
object |
An object representing a graph; either a generator list, an igraph object or an adjacency matrix. |
type |
Either "unrestricted" or "decomposable" |
ingraph |
If TRUE the result is the edges in the graph; if FALSE the result is the edges not in the graph. |
discrete |
This argument is relevant only if |
... |
Additional arguments; currently not used. |
When ingraph=TRUE: If type="decomposable" then
getEdges() returns those edges e for which the graph with e
removed is decomposable.
When ingraph=FALSE: Likewise, if type="decomposable" then
getEdges() returns those edges e for which the graph with e added is
decomposable.
The functions getInEdges() and getInEdges() are just wrappers
for calls to getEdges().
The workhorses are getInEdgesMAT() and getOutEdgesMAT() and
these work on adjacency matrices.
Regarding the argument discrete, please see the documentation of
mcs_marked.
A p * 2 matrix with edges.
These functions work on undirected graphs. The behaviour is undocumented for directed graphs.
Søren Højsgaard, [email protected]
gg <- ug(~a:b:d + a:c:d + c:e, result="igraph") glist <- getCliques(gg) adjmat <- as(gg, "matrix") #### On a glist getEdges(glist) getEdges(glist, type="decomposable") # Deleting (a,d) would create a 4-cycle getEdges(glist, ingraph=FALSE) getEdges(glist, type="decomposable", ingraph=FALSE) # Adding (e,b) would create a 4-cycle #### On a graphNEL getEdges(gg) getEdges(gg, type="decomposable") # Deleting (a,d) would create a 4-cycle getEdges(gg, ingraph=FALSE) getEdges(gg, type="decomposable", ingraph=FALSE) # Adding (e,b) would create a 4-cycle #### On an adjacency matrix getEdges(adjmat) getEdges(adjmat, type="decomposable") # Deleting (a,d) would create a 4-cycle getEdges(adjmat, ingraph=FALSE) getEdges(adjmat, type="decomposable", ingraph=FALSE) # Adding (e,b) would create a 4-cycle ## Marked graphs; vertices a,b are discrete; c,d are continuous UG <- ug(~a:b:c + b:c:d, result="igraph") disc <- c("a", "b") getEdges(UG) getEdges(UG, discrete=disc) ## Above: same results; there are 5 edges in the graph getEdges(UG, type="decomposable") ## Above: 4 edges can be removed and will give a decomposable graph ##(only removing the edge (b,c) would give a non-decomposable model) getEdges(UG, type="decomposable", discrete=c("a","b")) ## Above: 3 edges can be removed and will give a strongly decomposable ## graph. Removing (b,c) would create a 4--cycle and removing (a,b) ## would create a forbidden path; a path with only continuous vertices ## between two discrete vertices.gg <- ug(~a:b:d + a:c:d + c:e, result="igraph") glist <- getCliques(gg) adjmat <- as(gg, "matrix") #### On a glist getEdges(glist) getEdges(glist, type="decomposable") # Deleting (a,d) would create a 4-cycle getEdges(glist, ingraph=FALSE) getEdges(glist, type="decomposable", ingraph=FALSE) # Adding (e,b) would create a 4-cycle #### On a graphNEL getEdges(gg) getEdges(gg, type="decomposable") # Deleting (a,d) would create a 4-cycle getEdges(gg, ingraph=FALSE) getEdges(gg, type="decomposable", ingraph=FALSE) # Adding (e,b) would create a 4-cycle #### On an adjacency matrix getEdges(adjmat) getEdges(adjmat, type="decomposable") # Deleting (a,d) would create a 4-cycle getEdges(adjmat, ingraph=FALSE) getEdges(adjmat, type="decomposable", ingraph=FALSE) # Adding (e,b) would create a 4-cycle ## Marked graphs; vertices a,b are discrete; c,d are continuous UG <- ug(~a:b:c + b:c:d, result="igraph") disc <- c("a", "b") getEdges(UG) getEdges(UG, discrete=disc) ## Above: same results; there are 5 edges in the graph getEdges(UG, type="decomposable") ## Above: 4 edges can be removed and will give a decomposable graph ##(only removing the edge (b,c) would give a non-decomposable model) getEdges(UG, type="decomposable", discrete=c("a","b")) ## Above: 3 edges can be removed and will give a strongly decomposable ## graph. Removing (b,c) would create a 4--cycle and removing (a,b) ## would create a forbidden path; a path with only continuous vertices ## between two discrete vertices.
Fit graphical Gaussian model by iterative proportional fitting.
ggmfit( S, n.obs, glist, start = NULL, eps = 1e-12, iter = 1000, details = 0, ... )ggmfit( S, n.obs, glist, start = NULL, eps = 1e-12, iter = 1000, details = 0, ... )
S |
Empirical covariance matrix |
n.obs |
Number of observations |
glist |
Generating class for model (a list) |
start |
Initial value for concentration matrix |
eps |
Convergence criterion |
iter |
Maximum number of iterations |
details |
Controlling the amount of output. |
... |
Optional arguments; currently not used |
ggmfit is based on a C implementation. ggmfitr is
implemented purely in R (and is provided mainly as a benchmark for the
C-version).
A list with
lrt |
Likelihood ratio statistic (-2logL) |
df |
Degrees of freedom |
logL |
log likelihood |
K |
Estimated concentration matrix (inverse covariance matrix) |
Søren Højsgaard, [email protected]
## Fitting "butterfly model" to mathmark data ## Notice that the output from the two fitting functions is not ## entirely identical. data(math) glist <- list(c("al", "st", "an"), c("me", "ve", "al")) d <- cov.wt(math, method="ML") ggmfit (d$cov, d$n.obs, glist)## Fitting "butterfly model" to mathmark data ## Notice that the output from the two fitting functions is not ## entirely identical. data(math) glist <- list(c("al", "st", "an"), c("me", "ve", "al")) d <- cov.wt(math, method="ML") ggmfit (d$cov, d$n.obs, glist)
Specification of log–linear (graphical) model. The
'd' in the name dmod refers to that it is a (graphical)
model for 'd'iscrete variables
dmod( formula, data, marginal = NULL, interactions = NULL, fit = TRUE, details = 0, ... )dmod( formula, data, marginal = NULL, interactions = NULL, fit = TRUE, details = 0, ... )
formula |
Model specification in one of the following forms: 1) a right-hand sided formula, 2) as a list of generators, 3) an undirected graph (represented either as an igraph object or as an adjacency matrix). Notice that there are certain model specification shortcuts, see Section 'details' below. |
data |
Either a table or a dataframe. In the latter case, the dataframe will be coerced to a table. See 'details' below. |
marginal |
Should only a subset of the variables be used in connection with the model specification shortcuts |
interactions |
A number given the highest order interactions in the model, see Section 'details' below. |
fit |
Should the model be fitted. |
details |
Control the amount of output; for debugging purposes. |
... |
Additional arguments; currently no used. |
The independence model can be specified as ~.^1 and
~.^. specifies the saturated model. Setting
e.g. interactions=3 implies that there will be at most
three factor interactions in the model.
Data can be specified as a table of counts or as a dataframe. If
data is a dataframe then it will be converted to a table (using
xtabs()). This means that if the dataframe contains numeric
values then the you can get a very sparse and high dimensional
table. When a dataframe contains numeric values it may be
worthwhile to discretize data using the cut() function.
The marginal argument can be used for specifying the
independence or saturated models for only a subset of the
variables. When marginal is given the corresponding marginal
table of data is formed and used in the analysis (notice that this
is different from the behaviour of loglin() which uses the
full table.
The triangulate() method for discrete models (dModel
objects) will for a model look at the dependence graph for the
model.
An object of class dModel.
Søren Højsgaard, [email protected]
## Graphical log-linear model data(reinis) dm1 <- dmod(~ .^., reinis) dm2 <- backward(dm1, k=2) dm3 <- backward(dm1, k=2, fixin=list(c("family", "phys", "systol"))) ## At most 3-factor interactions dm1<-dmod(~ .^., data=reinis, interactions=3)## Graphical log-linear model data(reinis) dm1 <- dmod(~ .^., reinis) dm2 <- backward(dm1, k=2) dm3 <- backward(dm1, k=2, fixin=list(c("family", "phys", "systol"))) ## At most 3-factor interactions dm1<-dmod(~ .^., data=reinis, interactions=3)
General functions related to iModels
## S3 method for class 'iModel' logLik(object, ...) ## S3 method for class 'iModel' extractAIC(fit, scale, k = 2, ...) ## S3 method for class 'iModel' summary(object, ...) ## S3 method for class 'iModelsummary' print(x, ...) ## S3 method for class 'iModel' formula(x, ...) ## S3 method for class 'iModel' terms(x, ...) ## S3 method for class 'dModel' isGraphical(x) ## S3 method for class 'dModel' isDecomposable(x) modelProperties(object) ## S3 method for class 'dModel' modelProperties(object)## S3 method for class 'iModel' logLik(object, ...) ## S3 method for class 'iModel' extractAIC(fit, scale, k = 2, ...) ## S3 method for class 'iModel' summary(object, ...) ## S3 method for class 'iModelsummary' print(x, ...) ## S3 method for class 'iModel' formula(x, ...) ## S3 method for class 'iModel' terms(x, ...) ## S3 method for class 'dModel' isGraphical(x) ## S3 method for class 'dModel' isDecomposable(x) modelProperties(object) ## S3 method for class 'dModel' modelProperties(object)
object, fit, x
|
An |
... |
Currently unused. |
scale |
Unused (and irrelevant for these models) |
k |
Weight of the degrees of freedom in the AIC formula |
General functions related to iModels
getmi(object, name)getmi(object, name)
object |
An |
name |
The slot / information to be extracted. |
A mixed interaction model is a model (often with conditional independence restrictions) for a combination of discrete and continuous variables.
mmod(formula, data, marginal = NULL, fit = TRUE, details = 0)mmod(formula, data, marginal = NULL, fit = TRUE, details = 0)
formula |
A right hand sided formula specifying the model. |
data |
Data (a dataframe) |
marginal |
A possible subsets of columns of |
fit |
Currently not used |
details |
For printing debugging information |
An object of class mModel and the more general class
iModel.
Søren Højsgaard, [email protected]
### FIXME: To be written### FIXME: To be written
Impose zeros in matrix entries which do not correspond to an edge.
impose_zero(emat, K)impose_zero(emat, K)
emat |
Edge matrix (2 x p matrix) |
K |
Matrix; typically a concentration matrix. |
Return the dimension of a log-linear model given by the generating class 'glist'. If the model is decomposable and adjusted dimension can be found.
dim_loglin(glist, tableinfo) dim_loglin_decomp(glist, tableinfo, adjust = TRUE)dim_loglin(glist, tableinfo) dim_loglin_decomp(glist, tableinfo, adjust = TRUE)
glist |
Generating class (a list) for a log-linear model. See 'details' below. |
tableinfo |
Specification of the levels of the variables. See 'details' below. |
adjust |
Should model dimension be adjusted for sparsity of data (only available for decomposable models) |
glist can be either a list of vectors with variable names or a list
of vectors of variable indices.
tableinfo can be one of three different things.
A contingency table (a table).
A list with the names of the variables and their levels (such as one
would get if calling dimnames on a table).
A vector with the levels. If glist is a list of vectors with
variable names, then the entries of the vector tableinfo must be
named.
If the model is decomposable it dim_loglin_decomp is to be preferred over
dim_loglin as the former is much faster.
Setting adjust=TRUE will force dim_loglin_decomp to calculated a
dimension which is adjusted for sparsity of data. For this to work,
tableinfo MUST be a table.
A numeric.
Søren Højsgaard, [email protected]
## glist contains variable names and tableinfo is a named vector: dim_loglin(list(c("a", "b"), c("b", "c")), c(a=4, b=7, c=6)) ## glist contains variable names and tableinfo is not named: dim_loglin(list(c(1, 2), c(2, 3)), c(4, 7, 6)) ## For decomposable models: dim_loglin_decomp(list(c("a", "b"), c("b", "c")), c(a=4, b=7, c=6),adjust=FALSE)## glist contains variable names and tableinfo is a named vector: dim_loglin(list(c("a", "b"), c("b", "c")), c(a=4, b=7, c=6)) ## glist contains variable names and tableinfo is not named: dim_loglin(list(c(1, 2), c(2, 3)), c(4, 7, 6)) ## For decomposable models: dim_loglin_decomp(list(c("a", "b"), c("b", "c")), c(a=4, b=7, c=6),adjust=FALSE)
Fit log-linear models to multidimensional contingency tables by Iterative Proportional Fitting.
effloglin(table, margin, fit = FALSE, eps = 0.01, iter = 20, print = TRUE)effloglin(table, margin, fit = FALSE, eps = 0.01, iter = 20, print = TRUE)
table |
A contingency table |
margin |
A generating class for a hierarchical log–linear model |
fit |
If TRUE, the fitted values are returned. |
eps |
Convergence limit; see 'details' below. |
iter |
Maximum number of iterations allowed |
print |
If TRUE, iteration details are printed. |
The function differs from loglin in that 1) data
can be given in the form of a list of sufficient marginals and
2) the model is fitted only on the cliques of the triangulated
interaction graph of the model. This means that the full table
is not fitted, which means that effloglin is efficient
(in terms of storage requirements). However effloglin is
implemented entirely in R and is therefore slower than
loglin. Argument names are chosen so as to match those
of loglin()
A list.
Søren Højsgaard, [email protected]
Radim Jirousek and Stanislav Preucil (1995). On the effective implementation of the iterative proportional fitting procedure. Computational Statistics & Data Analysis Volume 19, Issue 2, February 1995, Pages 177-189
data(reinis) glist <-list(c("smoke", "mental"), c("mental", "phys"), c("phys", "systol"), c("systol", "smoke")) stab <- lapply(glist, function(gg) tabMarg(reinis, gg)) fv3 <- effloglin(stab, glist, print=FALSE)data(reinis) glist <-list(c("smoke", "mental"), c("mental", "phys"), c("phys", "systol"), c("systol", "smoke")) stab <- lapply(glist, function(gg) tabMarg(reinis, gg)) fv3 <- effloglin(stab, glist, print=FALSE)
Modify generating class for a graphical/hierarchical model by 1) adding edges, 2) deleting edges, 3) adding terms and 4) deleting terms.
modify_glist(glist, items, details = 0)modify_glist(glist, items, details = 0)
glist |
A list of vectors where each vector is a generator of the model. |
items |
A list with edges / terms to be added and deleted. See section 'details' below. |
details |
Control the amount of output (for debugging purposes). |
The items is a list with named entries as list(add.edge=,
drop.edge=, add.term=, drop.term=)
Not all entries need to be in the list. The corresponding actions are carried out in the order in which they appear in the list.
See section 'examples' below for examples.
Notice that the operations do not in general commute: Adding an edge which is already in a generating class and then removing the edge again does not give the original generating class.
A generating class for the modified model. The elements of the list are character vectors.
Søren Højsgaard, [email protected]
glist <- list(c(1, 2, 3), c(2, 3, 4)) ## Add edges modify_glist(glist, items=list(add.edge=c(1, 4))) modify_glist(glist, items=list(add.edge=~1:4)) ## Add terms modify_glist(glist, items=list(add.term=c(1, 4))) modify_glist(glist, items=list(add.term=~1:4)) ## Notice: Only the first term is added as the second is already ## in the model. modify_glist(glist, items=list(add.term=list(c(1, 4), c(1, 3)))) modify_glist(glist, items=list(add.term=~1:4 + 1:3)) ## Notice: Operations are carried out in the order given in the ## items list and hence we get different results: modify_glist(glist, items=list(drop.edge=c(1, 4), add.edge=c(1, 4))) modify_glist(glist, items=list(add.edge=c(1, 4), drop.edge=c(1, 4)))glist <- list(c(1, 2, 3), c(2, 3, 4)) ## Add edges modify_glist(glist, items=list(add.edge=c(1, 4))) modify_glist(glist, items=list(add.edge=~1:4)) ## Add terms modify_glist(glist, items=list(add.term=c(1, 4))) modify_glist(glist, items=list(add.term=~1:4)) ## Notice: Only the first term is added as the second is already ## in the model. modify_glist(glist, items=list(add.term=list(c(1, 4), c(1, 3)))) modify_glist(glist, items=list(add.term=~1:4 + 1:3)) ## Notice: Operations are carried out in the order given in the ## items list and hence we get different results: modify_glist(glist, items=list(drop.edge=c(1, 4), add.edge=c(1, 4))) modify_glist(glist, items=list(add.edge=c(1, 4), drop.edge=c(1, 4)))
Functions to convert between canonical parametrization (g,h,K), moment parametrization (p,m,S) and mixed parametrization (p,h,K).
parm_pms2ghk(parms) parm_ghk2pms(parms) parm_pms2phk(parms) parm_phk2ghk(parms) parm_phk2pms(parms) parm_ghk2phk(parms) parm_CGstats2mmod(parms, type = "ghk") parm_moment2pms(SS)parm_pms2ghk(parms) parm_ghk2pms(parms) parm_pms2phk(parms) parm_phk2ghk(parms) parm_phk2pms(parms) parm_ghk2phk(parms) parm_CGstats2mmod(parms, type = "ghk") parm_moment2pms(SS)
parms |
Parameters of a mixed interaction model |
type |
Output parameter type; either "ghk" or "pms". |
SS |
List of moment parameters. |
Parameters of a mixed interaction model.
Søren Højsgaard, [email protected]
Parse graphical model formula to internal representation
parse_gm_formula( formula, varnames = NULL, marginal = NULL, interactions = NULL, maximal_only = FALSE )parse_gm_formula( formula, varnames = NULL, marginal = NULL, interactions = NULL, maximal_only = FALSE )
formula |
A right hand sided formula or a list. |
varnames |
Specification of the variables. |
marginal |
Possible specification of marginal (a set of variables); useful in connection with model specification shortcuts. |
interactions |
The maximum order of interactions allowed; useful in connection with model specification shortcuts. |
maximal_only |
Should only maximal generators be retained. |
vn <- c("me", "ve", "al", "an", "st") form1 <- ~me:ve:al + ve:al + an form2 <- ~me:ve:al + ve:al + s form3 <- ~me:ve:al + ve:al + anaba parse_gm_formula(form1, varnames=vn) parse_gm_formula(form2, varnames=vn) ## parse_gm_formula(form3, varnames=vn) parse_gm_formula(form1) parse_gm_formula(form2) parse_gm_formula(form3) ## parse_gm_formula(~.^1) ## parse_gm_formula(~.^.) parse_gm_formula(~.^1, varnames=vn) parse_gm_formula(~.^., varnames=vn) parse_gm_formula(~.^., varnames=vn, interactions=3) vn2 <- vn[1:3] ## parse_gm_formula(form1, varnames=vn, marginal=vn2) ## parse_gm_formula(form2, varnames=vn, marginal=vn2) ## parse_gm_formula(form3, varnames=vn, marginal=vn2) parse_gm_formula(~.^1, varnames=vn, marginal=vn2) parse_gm_formula(~.^., varnames=vn, marginal=vn2)vn <- c("me", "ve", "al", "an", "st") form1 <- ~me:ve:al + ve:al + an form2 <- ~me:ve:al + ve:al + s form3 <- ~me:ve:al + ve:al + anaba parse_gm_formula(form1, varnames=vn) parse_gm_formula(form2, varnames=vn) ## parse_gm_formula(form3, varnames=vn) parse_gm_formula(form1) parse_gm_formula(form2) parse_gm_formula(form3) ## parse_gm_formula(~.^1) ## parse_gm_formula(~.^.) parse_gm_formula(~.^1, varnames=vn) parse_gm_formula(~.^., varnames=vn) parse_gm_formula(~.^., varnames=vn, interactions=3) vn2 <- vn[1:3] ## parse_gm_formula(form1, varnames=vn, marginal=vn2) ## parse_gm_formula(form2, varnames=vn, marginal=vn2) ## parse_gm_formula(form3, varnames=vn, marginal=vn2) parse_gm_formula(~.^1, varnames=vn, marginal=vn2) parse_gm_formula(~.^., varnames=vn, marginal=vn2)
Stepwise model selection in (graphical) interaction models
drop_func(criterion) ## S3 method for class 'iModel' stepwise( object, criterion = "aic", alpha = NULL, type = "decomposable", search = "all", steps = 1000, k = 2, direction = "backward", fixin = NULL, fixout = NULL, details = 0, trace = 2, ... ) backward( object, criterion = "aic", alpha = NULL, type = "decomposable", search = "all", steps = 1000, k = 2, fixin = NULL, details = 1, trace = 2, ... ) forward( object, criterion = "aic", alpha = NULL, type = "decomposable", search = "all", steps = 1000, k = 2, fixout = NULL, details = 1, trace = 2, ... )drop_func(criterion) ## S3 method for class 'iModel' stepwise( object, criterion = "aic", alpha = NULL, type = "decomposable", search = "all", steps = 1000, k = 2, direction = "backward", fixin = NULL, fixout = NULL, details = 0, trace = 2, ... ) backward( object, criterion = "aic", alpha = NULL, type = "decomposable", search = "all", steps = 1000, k = 2, fixin = NULL, details = 1, trace = 2, ... ) forward( object, criterion = "aic", alpha = NULL, type = "decomposable", search = "all", steps = 1000, k = 2, fixout = NULL, details = 1, trace = 2, ... )
criterion |
Either |
object |
An |
alpha |
Critical value for deeming an edge to be significant/
insignificant. When |
type |
Type of models to search. Either |
search |
Either |
steps |
Maximum number of steps. |
k |
Penalty term when |
direction |
Direction for model search. Either |
fixin |
Matrix (p x 2) of edges. If those edges are in the model, they are not considered for removal. |
fixout |
Matrix (p x 2) of edges. If those edges are not in the model, they are not considered for addition. |
details |
Controls the level of printing on the screen. |
trace |
For debugging only |
... |
Further arguments to be passed on to |
Søren Højsgaard, [email protected]
cmod, dmod, mmod,
testInEdges, testOutEdges
data(reinis) ## The saturated model m1 <- dmod(~.^., data=reinis) m2 <- stepwise(m1) m2data(reinis) ## The saturated model m1 <- dmod(~.^., data=reinis) m2 <- stepwise(m1) m2
Test edges in graphical models with p-value/AIC
value. The models must be iModels.
testEdges( object, edgeMAT = NULL, ingraph = TRUE, criterion = "aic", k = 2, alpha = NULL, headlong = FALSE, details = 1, ... ) testInEdges( object, edgeMAT = NULL, criterion = "aic", k = 2, alpha = NULL, headlong = FALSE, details = 1, ... ) testOutEdges( object, edgeMAT = NULL, criterion = "aic", k = 2, alpha = NULL, headlong = FALSE, details = 1, ... )testEdges( object, edgeMAT = NULL, ingraph = TRUE, criterion = "aic", k = 2, alpha = NULL, headlong = FALSE, details = 1, ... ) testInEdges( object, edgeMAT = NULL, criterion = "aic", k = 2, alpha = NULL, headlong = FALSE, details = 1, ... ) testOutEdges( object, edgeMAT = NULL, criterion = "aic", k = 2, alpha = NULL, headlong = FALSE, details = 1, ... )
object |
An |
edgeMAT |
A |
ingraph |
If TRUE, edges in graph are tested; if FALSE, edges not in graph are tested. |
criterion |
Either |
k |
Penalty term when |
alpha |
Critical value for deeming an edge to be significant/
insignificant. When |
headlong |
If TRUE then testing will stop once a model improvement has been found. |
details |
Controls the level of printing on the screen. |
... |
Further arguments to be passed on to |
testIn: Function which tests whether each edge in "edgeList" can be delete from model "object"
testOut: Is similar but in the other direction.
A dataframe with test statistics (p-value or change in AIC), edges and logical telling if the edge can be deleted.
Søren Højsgaard, [email protected]
data(math) cm1 <- cmod(~me:ve + ve:al + al:an, data=math) testEdges(cm1, ingraph=TRUE) testEdges(cm1, ingraph=FALSE) ## Same as # testInEdges(cm1) # testOutEdges(cm)data(math) cm1 <- cmod(~me:ve + ve:al + al:an, data=math) testEdges(cm1, ingraph=TRUE) testEdges(cm1, ingraph=FALSE) ## Same as # testInEdges(cm1) # testOutEdges(cm)
Performs a test of addition of an edge to a graphical
model (an iModel object).
testadd(object, edge, k = 2, details = 1, ...)testadd(object, edge, k = 2, details = 1, ...)
object |
A model; an object of class |
edge |
An edge; either as a vector or as a right hand sided formula. |
k |
Penalty parameter used when calculating change in AIC |
details |
The amount of details to be printed; 0 surpresses all information |
... |
Further arguments to be passed on to the underlying functions for testing. |
Let M0 be the model and e=(u,v) be an edge and let M1 be the model obtained by adding e to M0. If M1 is decomposable AND e is contained in one clique C only of M1 then the test is carried out in the C-marginal model. In this case, and if the model is a log-linear model then the degrees of freedom is adjusted for sparsity.
A list
Søren Højsgaard, [email protected]
## Discrete models data(reinis) ## A decomposable model mf <- ~smoke:phys:mental + smoke:systol:mental object <- dmod(mf, data=reinis) testadd(object, c("systol", "phys")) ## A non-decomposable model mf <- ~smoke:phys + phys:mental + smoke:systol + systol:mental object <- dmod(mf, data=reinis) testadd(object, c("phys", "systol")) ## Continuous models data(math) ## A decomposable model mf <- ~me:ve:al + al:an object <- cmod(mf, data=math) testadd(object, c("me", "an")) ## A non-decomposable model mf <- ~me:ve + ve:al + al:an + an:me object <- cmod(mf, data=math) testadd(object, c("me", "al"))## Discrete models data(reinis) ## A decomposable model mf <- ~smoke:phys:mental + smoke:systol:mental object <- dmod(mf, data=reinis) testadd(object, c("systol", "phys")) ## A non-decomposable model mf <- ~smoke:phys + phys:mental + smoke:systol + systol:mental object <- dmod(mf, data=reinis) testadd(object, c("phys", "systol")) ## Continuous models data(math) ## A decomposable model mf <- ~me:ve:al + al:an object <- cmod(mf, data=math) testadd(object, c("me", "an")) ## A non-decomposable model mf <- ~me:ve + ve:al + al:an + an:me object <- cmod(mf, data=math) testadd(object, c("me", "al"))
Tests if an edge can be deleted from an interaction model.
testdelete(object, edge, k = 2, details = 1, ...)testdelete(object, edge, k = 2, details = 1, ...)
object |
A model; an object of class |
edge |
An edge in the model; either as a right-hand sided formula or as a vector |
k |
Penalty parameter used when calculating change in AIC |
details |
The amount of details to be printed; 0 surpresses all information |
... |
Further arguments to be passed on to the underlying functions for testing. |
If the model is decomposable and the edge is contained in one clique only then the test is made in the marginal model given by that clique. In that case, if the model is a log-linear model then degrees of freedom are adjusted for sparsity
If model is decomposable and edge is in one clique only, then degrees of freedom are adjusted for sparsity
A list.
Søren Højsgaard, [email protected]
## Discrete models data(reinis) ## A decomposable model mf <- ~smoke:phys:mental + smoke:systol:mental object <- dmod(mf, data=reinis) testdelete(object, c("phys", "mental")) testdelete(object, c("smoke", "mental")) ## A non-decomposable model mf <- ~smoke:phys + phys:mental + smoke:systol + systol:mental object <- dmod(mf, data=reinis) testdelete(object, c("phys", "mental")) ## Continuous models data(math) ## A decomposable model mf <- ~me:ve:al + me:al:an object <- cmod(mf, data=math) testdelete(object, c("ve", "al")) testdelete(object, c("me", "al")) ## A non-decomposable model mf <- ~me:ve + ve:al + al:an + an:me object <- cmod(mf, data=math) testdelete(object, c("me", "ve"))## Discrete models data(reinis) ## A decomposable model mf <- ~smoke:phys:mental + smoke:systol:mental object <- dmod(mf, data=reinis) testdelete(object, c("phys", "mental")) testdelete(object, c("smoke", "mental")) ## A non-decomposable model mf <- ~smoke:phys + phys:mental + smoke:systol + systol:mental object <- dmod(mf, data=reinis) testdelete(object, c("phys", "mental")) ## Continuous models data(math) ## A decomposable model mf <- ~me:ve:al + me:al:an object <- cmod(mf, data=math) testdelete(object, c("ve", "al")) testdelete(object, c("me", "al")) ## A non-decomposable model mf <- ~me:ve + ve:al + al:an + an:me object <- cmod(mf, data=math) testdelete(object, c("me", "ve"))
Utilities for gRips
## S3 method for class 'gips_fit_class' logLik(object, ...) ## S3 method for class 'gips_fit_class' AIC(object, ..., k = 2) ## S3 method for class 'gips_fit_class' BIC(object, ...) ## S3 method for class 'gips_fit_class' sigma(object, ...) concentration(object, ...) ## S3 method for class 'gips_fit_class' concentration(object, ...) ## S3 method for class 'gips_fit_class' print(x, ...) ## S3 method for class 'gips_fit_class' summary(object, ...) glance.gips_fit_class(x, ...)## S3 method for class 'gips_fit_class' logLik(object, ...) ## S3 method for class 'gips_fit_class' AIC(object, ..., k = 2) ## S3 method for class 'gips_fit_class' BIC(object, ...) ## S3 method for class 'gips_fit_class' sigma(object, ...) concentration(object, ...) ## S3 method for class 'gips_fit_class' concentration(object, ...) ## S3 method for class 'gips_fit_class' print(x, ...) ## S3 method for class 'gips_fit_class' summary(object, ...) glance.gips_fit_class(x, ...)
object |
Model object. |
... |
Additional arguments; currently not used. |
k |
Penalty parameter for calculating AIC; only k=2 gives genuine AIC. |
x |
Object to be printed. |