Description Usage Arguments Details Value Author(s) Examples
Find the unconditional maximum likelihood estimate (jointly estimating marker frequencies in sources) of the contributions of different sources to a mixed stock, by either a direct-search or an expectation-maximization method
1 2 3 4 5 |
x |
a list with elements |
optmethod |
to be passed to optim |
grad |
function giving the gradient of the likelhood |
start.type |
starting values to use: |
fuzz |
min. value (1-min is the max.) for starting contributions |
bounds |
(bounds,1-bounds) are the lower and upper bounds for mle calculations |
ndepfac |
factor for computing numerical derivatives; numerical derivative stepsize is computed as bounds/ndepfac [OBSOLETE with gradient function?] |
method |
optimization method, to be passed to |
transf |
transformation |
debug |
produce debugging output? |
control |
other control arguments to |
... |
other arguments to |
prec |
precision for determining convergence of EM algorithm |
prior |
prior for EM algorithm |
uml
uses either a direct-search algorithm or an EM
algorithm to find the ML estimate
an object of class mixstock.est
, with elements
fit |
information on the ML fit |
resample |
bootstrap information, if any |
data |
original data used for estimate |
R |
number of sources |
H |
number of markers |
contin |
estimation done on transformed proportions? |
method |
optimization method |
boot.method |
resampling method |
boot.data |
raw resampling information |
gandr.diag |
Gelman-Rubin diagnostic information for MCMC estimates |
prior |
Prior for MCMC estimates |
em |
estimation done by EM algorithm? |
Ben Bolker
1 2 3 4 5 6 7 8 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.