Abstraction in Markov networks

Lorenza Saitta

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper a new approach is presented for taming the complexity of performing inferences on Markov networks. The approach consists in transforming the network into an abstract one, with a lower number of vertices. The abstract network is obtained through a partitioning of its set of cliques. The paper shows under what conditions exact inference may be obtained with reduced cost, and ways of partitioning the graph are discussed. An example, illustrating the method, is also described.

Original languageEnglish
Title of host publicationAI*IA 2013
Subtitle of host publicationAdvances in Artificial Intelligence - XIIIth International Conference of the Italian Association for Artificial Intelligence, Proceedings
Pages145-156
Number of pages12
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event13th International Conference of the Italian Association for Artificial Intelligence, AI*IA 2013 - Turin, Italy
Duration: 4 Dec 20136 Dec 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8249 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Conference of the Italian Association for Artificial Intelligence, AI*IA 2013
Country/TerritoryItaly
CityTurin
Period4/12/136/12/13

Keywords

  • Abstraction
  • Approximate inference
  • Graphical models
  • Markov networks

Fingerprint

Dive into the research topics of 'Abstraction in Markov networks'. Together they form a unique fingerprint.

Cite this