84 search results - page 6 / 17 » Learning structurally consistent undirected probabilistic gr... |
NIPS
2008
13 years 9 months ago
2008
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
ICA
2010
Springer
13 years 7 months ago
2010
Springer
We develop a probabilistic modeling framework for multiway arrays. Our framework exploits the link between graphical models and tensor factorization models and it can realize any ...
IJAR
2010
13 years 6 months ago
2010
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...
COLING
2008
13 years 9 months ago
2008
We propose a new integrated approach based on Markov logic networks (MLNs), an effective combination of probabilistic graphical models and firstorder logic for statistical relatio...