Sciweavers

150 search results - page 19 / 30
» Modelling Multiagent Bayesian Networks with Inclusion Depend...
Sort
View
JETAI
1998
110views more  JETAI 1998»
13 years 7 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
JMLR
2010
143views more  JMLR 2010»
13 years 2 months ago
Incremental Sigmoid Belief Networks for Grammar Learning
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
James Henderson, Ivan Titov
PERCOM
2007
ACM
14 years 7 months ago
Structural Learning of Activities from Sparse Datasets
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
Fahd Albinali, Nigel Davies, Adrian Friday
TASE
2008
IEEE
13 years 7 months ago
Mechanism Design for Single Leader Stackelberg Problems and Application to Procurement Auction Design
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
Dinesh Garg, Y. Narahari
ICML
2009
IEEE
14 years 8 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...