Knowledge revision in Markov networks.

Jörg Gebhardt; Christian Borgelt; Rudolf Kruse; Heinz Detmer

Mathware and Soft Computing (2004)

  • Volume: 11, Issue: 2-3, page 93-107
  • ISSN: 1134-5632

Abstract

top
A lot of research in graphical models has been devoted to developing correct and efficient evidence propagation methods, like join tree propagation or bucket elimination. With these methods it is possible to condition the represented probability distribution on given evidence, a reasoning process that is sometimes also called focusing. In practice, however, there is the additional need to revise the represented probability distribution in order to reflect some knowledge changes by satisfying new frame conditions. Pure evidence propagation methods, as implemented in the known commercial tools for graphical models, are unsuited for this task. In this paper we develop a consistent scheme for the important task of revising a Markov network so that it satisfies given (conditional) marginal distributions for some of the variables. This task is of high practical relevance as we demonstrate with a complex application for item planning and capacity management in the automotive industry at Volkswagen Group.

How to cite

top

Gebhardt, Jörg, et al. "Knowledge revision in Markov networks.." Mathware and Soft Computing 11.2-3 (2004): 93-107. <http://eudml.org/doc/39275>.

@article{Gebhardt2004,
abstract = {A lot of research in graphical models has been devoted to developing correct and efficient evidence propagation methods, like join tree propagation or bucket elimination. With these methods it is possible to condition the represented probability distribution on given evidence, a reasoning process that is sometimes also called focusing. In practice, however, there is the additional need to revise the represented probability distribution in order to reflect some knowledge changes by satisfying new frame conditions. Pure evidence propagation methods, as implemented in the known commercial tools for graphical models, are unsuited for this task. In this paper we develop a consistent scheme for the important task of revising a Markov network so that it satisfies given (conditional) marginal distributions for some of the variables. This task is of high practical relevance as we demonstrate with a complex application for item planning and capacity management in the automotive industry at Volkswagen Group.},
author = {Gebhardt, Jörg, Borgelt, Christian, Kruse, Rudolf, Detmer, Heinz},
journal = {Mathware and Soft Computing},
keywords = {Inteligencia artificial; Planificación; Proceso de Markov; Grafos; Distribución de probabilidad},
language = {eng},
number = {2-3},
pages = {93-107},
title = {Knowledge revision in Markov networks.},
url = {http://eudml.org/doc/39275},
volume = {11},
year = {2004},
}

TY - JOUR
AU - Gebhardt, Jörg
AU - Borgelt, Christian
AU - Kruse, Rudolf
AU - Detmer, Heinz
TI - Knowledge revision in Markov networks.
JO - Mathware and Soft Computing
PY - 2004
VL - 11
IS - 2-3
SP - 93
EP - 107
AB - A lot of research in graphical models has been devoted to developing correct and efficient evidence propagation methods, like join tree propagation or bucket elimination. With these methods it is possible to condition the represented probability distribution on given evidence, a reasoning process that is sometimes also called focusing. In practice, however, there is the additional need to revise the represented probability distribution in order to reflect some knowledge changes by satisfying new frame conditions. Pure evidence propagation methods, as implemented in the known commercial tools for graphical models, are unsuited for this task. In this paper we develop a consistent scheme for the important task of revising a Markov network so that it satisfies given (conditional) marginal distributions for some of the variables. This task is of high practical relevance as we demonstrate with a complex application for item planning and capacity management in the automotive industry at Volkswagen Group.
LA - eng
KW - Inteligencia artificial; Planificación; Proceso de Markov; Grafos; Distribución de probabilidad
UR - http://eudml.org/doc/39275
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.