124 search results - page 9 / 25 » Bottom-up learning of Markov logic network structure |
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
ECML
2007
Springer
15 years 3 months ago
2007
Springer
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
82
Voted
ICML
2010
IEEE
14 years 8 months ago
2010
IEEE
Classical dynamic Bayesian networks (DBNs) are based on the homogeneous Markov assumption and cannot deal with heterogeneity and non-stationarity in temporal processes. Various ap...
83
Voted
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a new unsupervised algorithm for training structured predictors that is discriminative, convex, and avoids the use of EM. The idea is to formulate an unsupervised versi...