Sciweavers

124 search results - page 8 / 25
» Bottom-up learning of Markov logic network structure
Sort
View
KI
2007
Springer
15 years 3 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
ICML
2009
IEEE
15 years 10 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...
ICDM
2006
IEEE
116views Data Mining» more  ICDM 2006»
15 years 3 months ago
Entity Resolution with Markov Logic
Entity resolution is the problem of determining which records in a database refer to the same entities, and is a crucial and expensive step in the data mining process. Interest in...
Parag Singla, Pedro Domingos
NIPS
2008
14 years 11 months ago
Partially Observed Maximum Entropy Discrimination Markov Networks
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
Jun Zhu, Eric P. Xing, Bo Zhang
ICMLA
2009
14 years 7 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...