Sciweavers

124 search results - page 7 / 25
» Bottom-up learning of Markov logic network structure
Sort
View
75
Voted
ICML
2008
IEEE
15 years 10 months ago
Laplace maximum margin Markov networks
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
Jun Zhu, Eric P. Xing, Bo Zhang
AAAI
2011
13 years 9 months ago
Abductive Markov Logic for Plan Recognition
Plan recognition is a form of abductive reasoning that involves inferring plans that best explain sets of observed actions. Most existing approaches to plan recognition and other ...
Parag Singla, Raymond J. Mooney
WWW
2009
ACM
15 years 10 months ago
Incorporating site-level knowledge to extract structured data from web forums
Web forums have become an important data resource for many web applications, but extracting structured data from unstructured web forum pages is still a challenging task due to bo...
Jiang-Ming Yang, Rui Cai, Yida Wang, Jun Zhu, Lei ...
NIPS
1997
14 years 10 months ago
Nonlinear Markov Networks for Continuous Variables
We address the problem of learning structure in nonlinear Markov networks with continuous variables. This can be viewed as non-Gaussian multidimensional density estimation exploit...
Reimar Hofmann, Volker Tresp
105
Voted
UAI
2008
14 years 11 months ago
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
Sebastian Riedel