Sciweavers

200 search results - page 3 / 40
» On the Consistency of Discrete Bayesian Learning
Sort
View
ICML
2009
IEEE
14 years 6 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
ICML
1998
IEEE
14 years 6 months ago
Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting
In a recent paper, Friedman, Geiger, and Goldszmidt [8] introduced a classifier based on Bayesian networks, called Tree Augmented Naive Bayes (TAN), that outperforms naive Bayes a...
Moisés Goldszmidt, Nir Friedman, Thomas J. ...
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
14 years 10 days ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula
ICPR
2008
IEEE
14 years 6 days ago
Prior-updating ensemble learning for discrete HMM
Ensemble learning is a variational Bayesian method in which an intractable distribution is approximated by a lower-bound. Ensemble learning results in models with better generaliz...
Gyeongyong Heo, Paul D. Gader
RECOMB
2003
Springer
14 years 6 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson