We describe a method for aligning multiple unlabeled configurations simultaneously, Specifically. we extend the two-con figuration matching approach of Green and Mardia (2006) to the multiple configuration setting. Our ...
Assuminga smooth trendp lus independente rrorm odel fort he environmentael ffects in the yields of a fieldp lot experiment,le ast squares smoothingm ethodsa re developed to estimate both the treatmente ffectsa nd the ...
An important problem in shape analysis is to match configurations of points in space after filtering out some geometrical transformation. In this paper we introduce hierarchical models for such tasks, in which the points ...
Hurn, M; Green, Peter; Al-Awadhi, F(Blackwell Publishing, 2008)
The Sloan digital sky survey is an extremely large astronomical survey that is conducted with the intention of mapping more than a quarter of the sky. Among the data that it is generating are spectroscopic and photometric ...
This paper establishes a general framework for Bayesian model-based clustering, in which subset labels are exchangeable, and items are also exchangeable, possibly up to covariate e?ects. It is rich enough to encompass a ...
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related approaches, require adjustment of a matching ...
We present Bayesian hierarchical models for the analysis of Affymetrix GeneChip data. The approach we take differs from other available approaches in two fundamental aspects. Firstly, we aim to integrate all processing ...
In a general estimation problem, the deviance function generates statistics that are similar to squared standardized residuals. A deviance-based M estimator (DBME) is defined as an adaptively weighted maximum-likelihood ...
Given a decomposable graph, we characterize and enumerate the set of pairs of vertices whose connection or disconnection results in a new graph that is also decomposable. We discuss the relevance of these results to Markov ...
We derive methods for enumerating the distinct junction tree representations for any given decomposable graph. We discuss the relevance of the method to estimating conditional independence graphs of graphical models and ...
We extend the model of Karlof and Wagner for modelling side channel attacks via Input Driven Hidden Markov Models (IDHMM) to the case where not every state corresponds to a single observable symbol. This allows us to examine ...
Real-world phenomena are frequently modelled by Bayesian hierarchical models. The building-blocks in such models are the distribution of each variable conditional on parent and/or neighbour variables in the graph. The ...
For a left-continuous random walk, absorbing at 0, the joint distribution of the maximum and time to absorption is derived. A description of the tails of the distributions and a conditional limit theorem are obtained for ...
The EM algorithmis a popular approach to maximuml ikelihoode stimationb ut has not been muchu sed forp enalizedl ikelihoodo r maximuma posteriori estimation.T his paper discussesp ropertieos f theE M algorithmin suchc ...
Many forensic genetics problems can be handled using structured systems of discrete variables, for which Bayesian networks offer an appealing practical modeling framework, and allow inferences to be computed by probability ...