Sciweavers

CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 5 months ago
Rate-Distortion via Markov Chain Monte Carlo
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
Shirin Jalali, Tsachy Weissman
CSDA
2010
208views more  CSDA 2010»
13 years 5 months ago
Bayesian density estimation and model selection using nonparametric hierarchical mixtures
We consider mixtures of parametric densities on the positive reals with a normalized generalized gamma process (Brix, 1999) as mixing measure. This class of mixtures encompasses t...
Raffaele Argiento, Alessandra Guglielmi, Antonio P...
CSDA
2010
118views more  CSDA 2010»
13 years 5 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 5 months ago
Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm
As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear fi...
Vincent Yan Fu Tan, Vivek K. Goyal
BMCBI
2007
127views more  BMCBI 2007»
13 years 5 months ago
A Latent Variable Approach for Meta-Analysis of Gene Expression Data from Multiple Microarray Experiments
Background: With the explosion in data generated using microarray technology by different investigators working on similar experiments, it is of interest to combine results across...
Hyungwon Choi, Ronglai Shen, Arul M. Chinnaiyan, D...
UAI
1996
13 years 6 months ago
Bayesian Learning of Loglinear Models for Neural Connectivity
This paper presents a Bayesian approach to learning the connectivity structure of a group of neurons from data on configuration frequencies. A major objective of the research is t...
Kathryn B. Laskey, Laura Martignon
UAI
2000
13 years 6 months ago
Minimum Message Length Clustering Using Gibbs Sampling
The K-Means and EM algorithms are popular in clustering and mixture modeling due to their simplicity and ease of implementation. However, they have several significant limitations...
Ian Davidson
WSC
1998
13 years 6 months ago
Bayesian Model Selection when the Number of Components is Unknown
In simulation modeling and analysis, there are two situations where there is uncertainty about the number of parameters needed to specify a model. The first is in input modeling w...
Russell C. H. Cheng
BMVC
2000
13 years 6 months ago
Parallel Chains, Delayed Rejection and Reversible Jump MCMC for Object Recognition
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...
M. Harkness, P. Green
NIPS
2003
13 years 6 months ago
Wormholes Improve Contrastive Divergence
In models that define probabilities via energies, maximum likelihood learning typically involves using Markov Chain Monte Carlo to sample from the model’s distribution. If the ...
Geoffrey E. Hinton, Max Welling, Andriy Mnih