Marginalization like a projection

dc.contributor.author	Verdegay López, Juan Francisco
dc.contributor.author	Moral Callejón, Serafín
dc.date.accessioned	2007-10-01T08:40:35Z
dc.date.available	2007-10-01T08:40:35Z
dc.date.issued	2001
dc.identifier.issn	1134-5632
dc.identifier.uri	http://hdl.handle.net/2099/3599
dc.description.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.
dc.format.extent	93-112
dc.language.iso	eng
dc.publisher	Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica
dc.relation.ispartof	Mathware & soft computing . 2001 Vol. 8 Núm. 2
dc.rights	Reconeixement-NoComercial-CompartirIgual 3.0 Espanya
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject.other	Approximate reasoning
dc.subject.other	Knowledge representation
dc.subject.other	Uncertainty
dc.subject.other	Capacities of order-2
dc.title	Marginalization like a projection
dc.type	Article
dc.subject.lemac	Intel·ligència artificial
dc.subject.ams	Classificació AMS::68 Computer science::68T Artificial intelligence
dc.rights.access	Open Access

UPCommons. Portal del coneixement obert de la UPC