10,704 research outputs found
Meta-analysis of functional neuroimaging data using Bayesian nonparametric binary regression
In this work we perform a meta-analysis of neuroimaging data, consisting of
locations of peak activations identified in 162 separate studies on emotion.
Neuroimaging meta-analyses are typically performed using kernel-based methods.
However, these methods require the width of the kernel to be set a priori and
to be constant across the brain. To address these issues, we propose a fully
Bayesian nonparametric binary regression method to perform neuroimaging
meta-analyses. In our method, each location (or voxel) has a probability of
being a peak activation, and the corresponding probability function is based on
a spatially adaptive Gaussian Markov random field (GMRF). We also include
parameters in the model to robustify the procedure against miscoding of the
voxel response. Posterior inference is implemented using efficient MCMC
algorithms extended from those introduced in Holmes and Held [Bayesian Anal. 1
(2006) 145--168]. Our method allows the probability function to be locally
adaptive with respect to the covariates, that is, to be smooth in one region of
the covariate space and wiggly or even discontinuous in another. Posterior
miscoding probabilities for each of the identified voxels can also be obtained,
identifying voxels that may have been falsely classified as being activated.
Simulation studies and application to the emotion neuroimaging data indicate
that our method is superior to standard kernel-based methods.Comment: Published in at http://dx.doi.org/10.1214/11-AOAS523 the Annals of
Applied Statistics (http://www.imstat.org/aoas/) by the Institute of
Mathematical Statistics (http://www.imstat.org
A sparse multinomial probit model for classification
A recent development in penalized probit modelling using a hierarchical Bayesian approach has led to a sparse binomial (two-class) probit classifier that can be trained via an EM algorithm. A key advantage of the formulation is that no tuning of hyperparameters relating to the penalty is needed thus simplifying the model selection process. The resulting model demonstrates excellent classification performance and a high degree of sparsity when used as a kernel machine. It is, however, restricted to the binary classification problem and can only be used in the multinomial situation via a one-against-all or one-against-many strategy. To overcome this, we apply the idea to the multinomial probit model. This leads to a direct multi-classification approach and is shown to give a sparse solution with accuracy and sparsity comparable with the current state-of-the-art. Comparative numerical benchmark examples are used to demonstrate the method
Non-Parametric Calibration of Probabilistic Regression
The task of calibration is to retrospectively adjust the outputs from a
machine learning model to provide better probability estimates on the target
variable. While calibration has been investigated thoroughly in classification,
it has not yet been well-established for regression tasks. This paper considers
the problem of calibrating a probabilistic regression model to improve the
estimated probability densities over the real-valued targets. We propose to
calibrate a regression model through the cumulative probability density, which
can be derived from calibrating a multi-class classifier. We provide three
non-parametric approaches to solve the problem, two of which provide empirical
estimates and the third providing smooth density estimates. The proposed
approaches are experimentally evaluated to show their ability to improve the
performance of regression models on the predictive likelihood
- …