Statistical relational learning : Structure learning for Markov logic networks

Abstract : A Markov Logic Network is composed of a set of weighted first-order logic formulas. In this dissertation we propose several methods to learn a MLN structure from a relational dataset. These methods are of two kinds: methods based on propositionalization and methods based on Graph of Predicates. The methods based on propositionalization are based on the idea of building a set of candidate clauses from sets of dependent variable literals. In order to find such sets of dependent variable literals, we use a propositionalization technique to transform relational information in the dataset into boolean tables, that are then provided as contingency tables for tests of dependence. Two propositionalization methods are proposed, from which three learners have been developed, that handle both generative and discriminative learning. We then introduce the concept of Graph of Predicates, which synthethises the binary relations between the predicates of a domain. Candidate clauses can be quickly and easily generated by simply finding paths in the graph and then variabilizing them. Based on this Graph, two learners have been developed, that handle both generative and discriminative learning.
Document type :
Theses
Complete list of metadatas

Cited literature [76 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00659738
Contributor : Abes Star <>
Submitted on : Thursday, April 12, 2012 - 8:17:43 AM
Last modification on : Thursday, January 17, 2019 - 3:06:06 PM
Long-term archiving on : Friday, July 13, 2012 - 9:16:41 AM

File

quang.dinh_2370.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00659738, version 2

Collections

Citation

Quang-Thang Dinh. Statistical relational learning : Structure learning for Markov logic networks. Other [cs.OH]. Université d'Orléans, 2011. English. ⟨NNT : 2011ORLE2047⟩. ⟨tel-00659738v2⟩

Share

Metrics

Record views

531

Files downloads

510