Sciweavers

528 search results - page 75 / 106
» Causal inference using the algorithmic Markov condition
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Learning first-order probabilistic models with combining rules
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...
Sriraam Natarajan, Prasad Tadepalli, Eric Altendor...
AUSAI
2006
Springer
15 years 1 months ago
Learning Hybrid Bayesian Networks by MML
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
Rodney T. O'Donnell, Lloyd Allison, Kevin B. Korb
JMLR
2006
118views more  JMLR 2006»
14 years 9 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 7 days ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
15 years 10 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...