Sciweavers

157 search results - page 18 / 32
» On Bayesian bounds
Sort
View
UAI
2004
13 years 11 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
SIAMCO
2008
112views more  SIAMCO 2008»
13 years 9 months ago
A Knowledge-Gradient Policy for Sequential Information Collection
In a sequential Bayesian ranking and selection problem with independent normal populations and common known variance, we study a previously introduced measurement policy which we ...
Peter Frazier, Warren B. Powell, Savas Dayanik
ML
2012
ACM
385views Machine Learning» more  ML 2012»
12 years 5 months ago
An alternative view of variational Bayes and asymptotic approximations of free energy
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
Kazuho Watanabe
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 10 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 4 months ago
Scalable Fault Diagnosis in IP Networks using Graphical Models: A Variational Inference Approach
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
Rajesh Narasimha, Souvik Dihidar, Chuanyi Ji, Stev...