Boolean Models: Maximum Likelihood Estimation from Circular Clumps

This paper deals with the problem of making inferences on the maximum radius and the intensity of the Poisson point process associated to a Boolean Model of circular primary grains with uniformly distributed random radii. The only sample information used is observed radii of circular clumps (DUPAC, 1980). The behaviour of maximum likelihood estimation has been evaluated by means of Monte Carlo methods.     

Estimating the Weighting Components of a Health Quality Index

This paper introduces a maximum likelihood estimation model that uses patients' pretherapy characteristics to determine the weighting components of multipe outcomes of quality health. The resulting health quality index' can then be included in cost-effectiveness analyses to compare alternative treatment plans. A Monte Carlo simulation is performed to test the model's robustness and power.     

Estimating Mean Landmark Triangles

The paper deals with the statistical estimation of mean triangles of landmark data. For the model introduced by Bookstein (1986) three methods of estimating the “ideal” triangle are compared: the maximum likelihood method based on the exact distribution given in Mardia and Dryden (1989a), a moment method and an iterative algorithm yielding a mean triangle in the sense of Fréchet. These methods are compared by Monte Carlo simulation applied also to models with variances greater than those required for Bookstein's normal approximation.     

Small Sample Properties of the Likelihood Estimator in Proportional Hazard Regression Models with Omitted Variables

The paper deals with the effects of incorrectly omitted regressor variables in a parametric proportional hazard regression model. By studying conditions for equality between the estimators of correct and incorrect models it is demonstrated analytically that such cases are not to be expected in practise. A small sample Monte Carlo experiment indicates severe negative effects on the retained parameters both in terms of bias and mean square error.     

Jeffreys' Likelihood Ratio for the 2×2-Table — A Monte Carlo Study —

Jeffreys' approach for analyzing a 2×2-table is discussed via a Monte Carlo study. The main findings are reported.     

Bayesian phylogenetic model selection using reversible jump Markov chain Monte Carlo

A common problem in molecular phylogenetics is choosing a model of DNA substitution that does a good job of explaining the DNA sequence alignment without introducing superfluous parameters. A number of methods have been used to choose among a small set of candidate substitution models, such as the likelihood ratio test, the Akaike Information Criterion (AIC), the Bayesian Information Criterion (BIC), and Bayes factors. Current implementations of any of these criteria suffer from the limitation that only a small set of models are examined, or that the test does not allow easy comparison of non-nested models. In this article, we expand the pool of candidate substitution models to include all possible time-reversible models. This set includes seven models that have already been described. We show how Bayes factors can be calculated for these models using reversible jump Markov chain Monte Carlo, and apply the method to 16 DNA sequence alignments. For each data set, we compare the model with the best Bayes factor to the best models chosen using AIC and BIC. We find that the best model under any of these criteria is not necessarily the most complicated one; models with an intermediate number of substitution types typically do best. Moreover, almost all of the models that are chosen as best do not constrain a transition rate to be the same as a transversion rate, suggesting that it is the transition/transversion rate bias that plays the largest role in determining which models are selected. Importantly, the reversible jump Markov chain Monte Carlo algorithm described here allows estimation of phylogeny (and other phylogenetic model parameters) to be performed while accounting for uncertainty in the model of DNA substitution.     

Bayesian Neural Network Models for Censored Data

Neural networks are considered by many to be very promising tools for classification and prediction. The flexibility of the neural network models often result in over-fit. Shrinking the parameters using a penalized likelihood is often used in order to overcome such over-fit. In this paper we extend the approach proposed by FARAGGI and SIMON (1995a) to modeling censored survival data using the input-output relationship associated with a single hidden layer feed-forward neural network. Instead of estimating the neural network parameters using the method of maximum likelihood, we place normal prior distributions on the parameters and make inferences based on derived posterior distributions of the parameters. This Bayesian formulation will result in shrinking the parameters of the neural network model and will reduce the over-fit compared with the maximum likelihood estimators. We illustrate our proposed method on a simulated and a real example.     

Estimating the life-span of oligodendrocytes from clonal data on their development in cell culture

This paper presents a new method to analyze clonal data on oligodendrocyte development in cell culture. The process of oligodendrocyte generation from precursor cells is modelled as a multi-type Bellman-Harris branching process as suggested in an earlier paper [K. Boucher, A. Zorin, A.Y. Yakovlev, M. Mayer-Proschel, M. Noble, An alternative stochastic model of generation of oligodendrocytes in cell culture, J. Math. Biol. 43 (2001) 22]. This model has been extended to allow for death of oligodendrocytes as well as a dissimilar distribution of the first mitotic cycle duration as compared to the subsequent cycles of precursor cells, which lengths are assumed to be independent and identically distributed random variables. Since the time-span of oligodendrocytes is not directly observable in clonal data, plausible parametric assumptions are invoked to make estimation problems tractable. In particular, the time to cell death follows a two-parameter gamma distribution, while the lapse of time between the event of cell death and the event of cell disintegration is assumed to be exponentially distributed. A simulated pseudo maximum likelihood method for estimation of model parameters has been developed using simulation-based approximations of the expected numbers and variance-covariance matrices for different types of cells. Finite sample properties of the estimation procedure are studied by computer simulations. The proposed method is illustrated with an analysis of the clonal development of O-2A progenitor cells isolated from the rat optic nerve and the corpus callosum.     

Tree-based maximal likelihood substitution matrices and hidden Markov models

There has been considerable interest in the problem of making maximum likelihood (ML) evolutionary trees which allow insertions and deletions. This problem is partly one of formulation: how does one define a probabilistic model for such trees which treats insertion and deletion in a biologically plausible manner? A possible answer to this question is proposed here by extending the concept of a hidden Markov model (HMM) to evolutionary trees. The model, called a tree-HMM, allows what may be loosely regarded as learnable affine-type gap penalties for alignments. These penalties are expressed in HMMs as probabilities of transitions between states. In the tree-HMM, this idea is given an evolutionary embodiment by defining trees of transitions. Just as the probability of a tree composed of ungapped sequences is computed, by Felsenstein's method, using matrices representing the probabilities of substitutions of residues along the edges of the tree, so the probabilities in a tree-HMM are computed by substitution matrices for both residues and transitions. How to define these matrices by a ML procedure using an algorithm that learns from a database of protein sequences is shown here. Given these matrices, one can define a tree-HMM likelihood for a set of sequences, assuming a particular tree topology and an alignment of the sequences to the model. If one could efficiently find the alignment which maximizes (or comes close to maximizing) this likelihood, then one could search for the optimal tree topology for the sequences. An alignment algorithm is defined here which, given a particular tree topology, is guaranteed to increase the likelihood of the model. Unfortunately, it fails to find global optima for realistic sequence sets. Thus further research is needed to turn the tree-HMM into a practical phylogenetic tool.