Learning in Probabilistic Graphs Exploiting Language-Constrained Patterns

Abstract

The probabilistic graphs framework models the uncertainty inherent in real-world domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this paper is to provide a learning method to compute the most likely relationship between two nodes in a framework based on probabilistic graphs. In particular, given a probabilistic graph we adopted the language-constrained reachability method to compute the probability of possible interconnections that may exists between two nodes. Each of these connections may be viewed as feature, or a factor, between the two nodes and the corresponding probability as its weight. Each observed link is considered as a positive instance for its corresponding link label. Given the training set of observed links a L2-regularized Logistic Regression has been adopted to learn a model able to predict unobserved link labels.

DOI: 10.1007/978-3-642-37382-4_11

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Taranto2012LearningIP, title={Learning in Probabilistic Graphs Exploiting Language-Constrained Patterns}, author={Claudio Taranto and Nicola Di Mauro and Floriana Esposito}, booktitle={NFMCP}, year={2012} }