One popular class of such models are Markov networks, which use an undirected graph to represent dependencies among variables. Markov networks of low tree-width (i.e. having a triangulation with small cliques ) allow efficient computations, and are useful as learned probability models [8]. A well studied case is that in which the dependency structure is known in advance. In this case the underl...

We put forward a new method of growing regression trees via maximum likelihood. It inherits the CART (Brieman et al., 1984) backward fitting idea. However, standard likelihood based methods such as model selection criteria and likelihood ratio tests are naturally incorporated into each stage of the tree procedure. Compared with other least squared tree methods, maximum likelihood regression tre...

We present a novel method to recontruct the mass distribution of galaxy clusters from their gravitational lens effect on background galaxies. The method is based on a least-χ fit of the two-dimensional gravitational cluster potential. The method combines information from shear and magnification by the cluster lens and is designed to easily incorporate possible additional information. We describ...

Looking myopically at the larger features of the likelihood function, absent some fine detail, can theoretically improve maximum likelihood estimation. Such estimators are, in fact, used routinely, since numerical techniques for maximizing a computationally expensive likelihood function or for maximizing a Monte Carlo approximation to a likelihood function may be unable to investigate small sca...

Constrained Maximum Likelihood (CML) is a new software module developed at Aptech Systems for the generation of maximum likelihood estimates of statistical models with general constraints on parameters. These constraints can be linear or nonlinear, equality or inequality. The software uses the Sequential Quadratic Programming method with various descent algorithms to iterate from a given starti...

Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers of polynomials. We study the algebraic degree of the critical equations of this optimization problem. This degree is related to the number of bounded regions in the corresponding arrangement of hypersurfaces, and to the Euler characteristic of the complexified complement. Under suitable hypotheses...

Two new approaches to multivariate calibration are described that, for the first time, allow information on measurement uncertainties to be included in the calibration process in a statistically meaningful way. The new methods, referred to as maximum likelihood principal components regression (MLPCR) and maximum likelihood latent root regression (MLLRR), are based on principles of maximum likel...

This paper surveys the theoretical and computational development of the restricted maximum likelihood (REML) approach for the estimation of covariance matrices in linear stochastic models. A new derivation of this approach is given, valid under very weak conditions on the noise. Then the calculation of the gradient of restricted loglikelihood functions is discussed , with special emphasis on th...

A likelihood-based approach to density modification is developed that can be applied to a wide variety of cases where some information about the electron density at various points in the unit cell is available. The key to the approach consists of developing likelihood functions that represent the probability that a particular value of electron density is consistent with prior expectations for t...

Whole genome shotgun assembly is the process of taking many short sequenced segments (reads) and reconstructing the genome from which they originated. We demonstrate how the technique of bidirected network flow can be used to explicitly model the double-stranded nature of DNA for genome assembly. By combining an algorithm for the Chinese Postman Problem on bidirected graphs with the constructio...