Sciweavers

108 search results - page 9 / 22
» Zeta: A Global Method for Discretization of Continuous Varia...
Sort
View
EMMCVPR
2011
Springer
13 years 9 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr
ICML
2003
IEEE
15 years 3 months ago
Evolutionary MCMC Sampling and Optimization in Discrete Spaces
The links between genetic algorithms and population-based Markov Chain Monte Carlo (MCMC) methods are explored. Genetic algorithms (GAs) are well-known for their capability to opt...
Malcolm J. A. Strens
NIPS
2003
14 years 11 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
BMCBI
2008
166views more  BMCBI 2008»
14 years 9 months ago
Learning transcriptional regulatory networks from high throughput gene expression data using continuous three-way mutual informa
Background: Probability based statistical learning methods such as mutual information and Bayesian networks have emerged as a major category of tools for reverse engineering mecha...
Weijun Luo, Kurt D. Hankenson, Peter J. Woolf
ECML
2007
Springer
15 years 3 months ago
Nondeterministic Discretization of Weights Improves Accuracy of Neural Networks
Abstract. The paper investigates modification of backpropagation algorithm, consisting of discretization of neural network weights after each training cycle. This modification, a...
Marcin Wojnarski