autologistic(formula, data, A, method = c("pl", "bayes"),
optit = 1000, model = TRUE, x = FALSE, y = FALSE,
type = c("SOCK", "PVM", "MPI", "NWS"), bootit = 1000,
parallel = TRUE, nodes, trainit = 1e+05, tol = 0.01,
minit = 10000, maxit = 1e+06, sigma = 1e+06,
eta.max = 2)formula:
a symbolic description of the model to be fitted.as.data.frame to a
data frame) containing the variables in the model. If not
found in data, the variables are taplbayesoptim in obtaining the MPLE estimate of
$\theta$. Defaults to 1,000.TRUE, in which
case the number of nodes must be supplied.SOCKPVMMPINWStol, no more
samples are drawn from the posterior. Defaults to 0.01.tol or when
maxit samples have been drawn, whichever happens
first. Defaults to 1,000,000.autologistic returns an object of class
autologisticiter by $p$ matrix containing the
bootstrap/posterior samples.y vector used.optim succeeded in optimizing the
pseudolikelihood. Possible error codes are 1 and 10. The
former indicates that the iteration limit was reached
before optimization completed. The latter indicates that
the Nelder-Mead simplex degenerated.convergence
equal to 1 or 10.terms
object used.data argument.rautologistic). The bootstrap samples can
be generated in parallel using the eta.max) by the
user.
The posterior covariance matrix of
$\theta$ is estimated using samples obtained during a
training run. The default number of iterations for the
training run is 100,000, but this can be controlled by
the user (via argument trainit). The estimated
covariance matrix is then used as the proposal variance
for a Metropolis-Hastings random walk. The proposal
distribution is normal. The posterior samples obtained
during the second run are used for inference. The length
of the run can be controlled by the user via arguments
minit, maxit, and tol. The first
determines the minimum number of iterations. If
minit has been reached, the sampler will terminate
when maxit is reached or all Monte Carlo standard
errors are smaller than tol, whichever happens
first.Hughes, J., Haran, M. and Caragea, P. C. (2011) Autologistic models for binary data on a lattice. Environmetrics, 22(7), 857--871.
Moller, J., Pettitt, A., Berthelsen, K., and Reeves, R. (2006) An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants. Biometrika, 93(2), 451--458.
rautologistic,
residuals.autologistic,
summary.autologistic,
vcov.autologistic