Sciweavers

569 search results - page 2 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
CVPR
2008
IEEE
15 years 11 months ago
Incremental learning of nonparametric Bayesian mixture models
Clustering is a fundamental task in many vision applications. To date, most clustering algorithms work in a batch setting and training examples must be gathered in a large group b...
Ryan Gomes, Max Welling, Pietro Perona
AAAI
2008
15 years 3 days ago
Bounding the False Discovery Rate in Local Bayesian Network Learning
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
Ioannis Tsamardinos, Laura E. Brown
ECAI
2006
Springer
15 years 1 months ago
Improving Bound Propagation
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
Bozhena Bidyuk, Rina Dechter
ECAI
2010
Springer
14 years 10 months ago
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
Johan Kwisthout, Hans L. Bodlaender, Linda C. van ...
ICASSP
2011
IEEE
14 years 1 months ago
A sliding-window online fast variational sparse Bayesian learning algorithm
In this work a new online learning algorithm that uses automatic relevance determination (ARD) is proposed for fast adaptive nonlinear filtering. A sequential decision rule for i...
Thomas Buchgraber, Dmitriy Shutin, H. Vincent Poor