Sciweavers

95 search results - page 8 / 19
» Learning Markov Logic Networks Using Structural Motifs
Sort
View
KI
2007
Springer
14 years 2 months ago
Extending Markov Logic to Model Probability Distributions in Relational Domains
Abstract. Markov logic, as a highly expressive representation formalism that essentially combines the semantics of probabilistic graphical models with the full power of first-orde...
Dominik Jain, Bernhard Kirchlechner, Michael Beetz
WWW
2009
ACM
14 years 9 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 ...
ICML
2009
IEEE
14 years 9 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...
ICML
2005
IEEE
14 years 9 months ago
Predicting protein folds with structural repeats using a chain graph model
Protein fold recognition is a key step towards inferring the tertiary structures from amino-acid sequences. Complex folds such as those consisting of interacting structural repeat...
Yan Liu, Eric P. Xing, Jaime G. Carbonell
ICMLA
2009
13 years 6 months ago
Learning Parameters for Relational Probabilistic Models with Noisy-Or Combining Rule
Languages that combine predicate logic with probabilities are needed to succinctly represent knowledge in many real-world domains. We consider a formalism based on universally qua...
Sriraam Natarajan, Prasad Tadepalli, Gautam Kunapu...