Sciweavers

175 search results - page 16 / 35
» Learning Continuous Time Bayesian Networks
Sort
View
CEC
2007
IEEE
14 years 2 months ago
Evolving the best-response strategy to decide when to make a proposal
— This paper designed and developed negotiation agents with the distinguishing features of 1) conducting continuous time negotiation rather than discrete time negotiation, 2) lea...
Bo An, Kwang Mong Sim, Victor R. Lesser
AUSAI
2006
Springer
13 years 11 months ago
Voting Massive Collections of Bayesian Network Classifiers for Data Streams
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
Remco R. Bouckaert
AAAI
2008
13 years 10 months ago
Latent Tree Models and Approximate Inference in Bayesian Networks
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
Yi Wang, Nevin Lianwen Zhang, Tao Chen
BMCBI
2007
172views more  BMCBI 2007»
13 years 7 months ago
Bayesian approaches to reverse engineer cellular systems: a simulation study on nonlinear Gaussian networks
Background: Reverse engineering cellular networks is currently one of the most challenging problems in systems biology. Dynamic Bayesian networks (DBNs) seem to be particularly su...
Fulvia Ferrazzi, Paola Sebastiani, Marco Ramoni, R...
IJAR
2010
152views more  IJAR 2010»
13 years 6 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...