Learning Bayesian networks from data by the incremental compilation of new network polynomials

Benjumeda Barquita, Marco (2014). Learning Bayesian networks from data by the incremental compilation of new network polynomials. Thesis (Master thesis), Facultad de Informática (UPM).

Description

Title: Learning Bayesian networks from data by the incremental compilation of new network polynomials
Author/s:
  • Benjumeda Barquita, Marco
Contributor/s:
  • Bielza Lozoya, Maria Concepcion
  • Larrañaga, Pedro
Item Type: Thesis (Master thesis)
Masters title: Inteligencia Artificial
Date: 25 October 2014
Subjects:
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: None

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview

Abstract

Probabilistic graphical models are a huge research field in artificial intelligence nowadays. The scope of this work is the study of directed graphical models for the representation of discrete distributions. Two of the main research topics related to this area focus on performing inference over graphical models and on learning graphical models from data. Traditionally, the inference process and the learning process have been treated separately, but given that the learned models structure marks the inference complexity, this kind of strategies will sometimes produce very inefficient models. With the purpose of learning thinner models, in this master thesis we propose a new model for the representation of network polynomials, which we call polynomial trees. Polynomial trees are a complementary representation for Bayesian networks that allows an efficient evaluation of the inference complexity and provides a framework for exact inference. We also propose a set of methods for the incremental compilation of polynomial trees and an algorithm for learning polynomial trees from data using a greedy score+search method that includes the inference complexity as a penalization in the scoring function.

More information

Item ID: 35308
DC Identifier: http://oa.upm.es/35308/
OAI Identifier: oai:oa.upm.es:35308
Deposited by: Marco Alberto Benjumeda Barquita
Deposited on: 21 May 2015 12:56
Last Modified: 08 Feb 2016 11:47
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM