Marginalization like a projection.

Juan Francisco Verdegay-López; Serafín Moral

Mathware and Soft Computing (2001)

  • Volume: 8, Issue: 2, page 93-112
  • ISSN: 1134-5632

Abstract

top
This paper studies the problem of marginalizing convex polytopes of probabilities represented by a set of constraints. This marginalization is obtained as a special case of projection on a specific subspace. An algorithm that projects a convex polytope on any subspace has been built and the expression of the subspace, where the projection must be made for obtaining the marginalization, has been calculated.

How to cite

top

Verdegay-López, Juan Francisco, and Moral, Serafín. "Marginalization like a projection.." Mathware and Soft Computing 8.2 (2001): 93-112. <http://eudml.org/doc/39215>.

@article{Verdegay2001,
abstract = {This paper studies the problem of marginalizing convex polytopes of probabilities represented by a set of constraints. This marginalization is obtained as a special case of projection on a specific subspace. An algorithm that projects a convex polytope on any subspace has been built and the expression of the subspace, where the projection must be made for obtaining the marginalization, has been calculated.},
author = {Verdegay-López, Juan Francisco, Moral, Serafín},
journal = {Mathware and Soft Computing},
keywords = {Politopos; Distribución marginal; Distribución de probabilidad; Inteligencia artificial; Grafos difusos; Estructuras proyectivas; approximate reasoning; knowledge representation; uncertainty},
language = {eng},
number = {2},
pages = {93-112},
title = {Marginalization like a projection.},
url = {http://eudml.org/doc/39215},
volume = {8},
year = {2001},
}

TY - JOUR
AU - Verdegay-López, Juan Francisco
AU - Moral, Serafín
TI - Marginalization like a projection.
JO - Mathware and Soft Computing
PY - 2001
VL - 8
IS - 2
SP - 93
EP - 112
AB - This paper studies the problem of marginalizing convex polytopes of probabilities represented by a set of constraints. This marginalization is obtained as a special case of projection on a specific subspace. An algorithm that projects a convex polytope on any subspace has been built and the expression of the subspace, where the projection must be made for obtaining the marginalization, has been calculated.
LA - eng
KW - Politopos; Distribución marginal; Distribución de probabilidad; Inteligencia artificial; Grafos difusos; Estructuras proyectivas; approximate reasoning; knowledge representation; uncertainty
UR - http://eudml.org/doc/39215
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.