Number of the records: 1

An Effective Algorithm to Search Reductions in Compositional Models

SYSNO ASEP	0086632
Document Type	K - Proceedings Paper (Czech conf.)
R&D Document Type	Conference Paper
Title	An Effective Algorithm to Search Reductions in Compositional Models
Title	Efektivní algoritmus na hledání redukcí v kompozicionálních modelech
Author(s)	Kratochvíl, Václav (UTIA-B)_{RID, ORCID}
Source Title	Proceedings of Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty /10./. - Praha : UTIA AV ČR, 2007 / Kroupa T. ; Vejnarová J. S. 75-86
Number of pages	12 s.
Action	Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty /10./
Event date	15.09.2007-18.09.2007
VEvent location	Liblice
Country	CZ - Czech Republic
Event type	WRD
Language	eng - English
Country	CZ - Czech Republic
Keywords	compositional model ; marginalization ; reduction
Subject RIV	BA - General Mathematics
R&D Projects	1M0572 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
	IAA2075302 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
CEZ	AV0Z10750506 - UTIA-B (2005-2011)
Annotation	This paper deals with the problem of marginalization of multidimensional probability distributions represented by a compositional model. By the perfect one in this case. From the computational point of view this solution is more efficient than any known marginalization process for Bayesian models. This is because the process mentioned in the paper in a form of an algorithm and takes an advantage of the fact that the perfect sequence models have some information encoded; if can be obtained from the Bayesian networks by an application of rather computationally expensive procedures. One part of that algorithm is marginalization by means of reduction. This paper describe a new faster algorithm to find a reduction in a compositional model.
Workplace	Institute of Information Theory and Automation
Contact	Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
Year of Publishing	2008

Number of the records: 1