Sciweavers

1697 search results - page 37 / 340
» On Bayesian Case Matching
Sort
View
IJAR
2006
118views more  IJAR 2006»
13 years 9 months ago
Learning Bayesian network parameters under order constraints
We consider the problem of learning the parameters of a Bayesian network from data, while taking into account prior knowledge about the signs of influences between variables. Such...
A. J. Feelders, Linda C. van der Gaag

Publication
151views
12 years 7 months ago
Robust Bayesian reinforcement learning through tight lower bounds
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
Christos Dimitrakakis
FASE
2008
Springer
13 years 11 months ago
Software Quality Improvement Via Pattern Matching
Abstract. Nested if-then-else statements is the most common programming schema in applications like data transformation or data analysis. In most cases, these can be replaced by hi...
Radu Kopetz, Pierre-Etienne Moreau
CVPR
2007
IEEE
14 years 11 months ago
Layered Graph Match with Graph Editing
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
Liang Lin, Song Chun Zhu, Yongtian Wang
IJAR
2010
75views more  IJAR 2010»
13 years 7 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...