bibtype	C - Conference Paper (international conference)
ARLID	0087125
utime	20240103184531.7
mtime	20071010235959.9
title (primary) (eng)	Compositional Models and Maximum Entropy Principle
specification	page_count 7 s.
serial	ARLID cav_un_epca*0087124 ISSN 1539-2023 title Proceedings of the 6th International Conference on Information and Management Sciences page_num 289-295 publisher place San Luis Obispo name California Polytechnic State University year 2007 editor name1 Lee name2 T. S. editor name1 Liu name2 Y. editor name1 Zhao name2 X.
title (cze)	Kompozicionální modely a princip maximální entropie
keyword	entropy
keyword	probability
keyword	operator of composition
keyword	multidimensional model
author (primary)	ARLID cav_un_auth*0101118 name1 Jiroušek name2 Radim institution UTIA-B full_dept Department of Decision Making Theory fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author	ARLID cav_un_auth*0231129 name1 Malec name2 M. country CZ
cas_special	project project_id 1M0572 agency GA MŠk country CZ ARLID cav_un_auth*0001814 project project_id 2C06019 agency GA MŠk country CZ ARLID cav_un_auth*0216518 project project_id IAA2075302 agency GA AV ČR ARLID cav_un_auth*0001801 research CEZ:AV0Z10750506 abstract (eng) This paper deals with a (relatively) new way of modeling of multidimensional probability distributions, with so called compositional models. It shows that the models forming a special subclass of compositional models, known under the name of perfect sequence models, corresponds with the family of the maximum entropy extensions, which can be computed with the famous Iterative Proportional Fitting Procedure. In addition to this it shows that computation of Shannon entropy for these models is (algorithmically) simple. abstract (cze) Článek se zabývá relativně novým způsobem tvorby mnohodimensionálních modelů; tzv. kompozicionálními modely. Ukazuje, že speciální třída těchto modelů známá pod názvem perfektní modely odpovídá maximálně entropickým extensím, které je možno počítat pomocí známé procedury IPFP. V článku je navíc ukázáno, že výpočet entropie pro tento typ mnohodimensionálních modelů je algoritmicky jednoduchý. action ARLID cav_un_auth*0231043 name International Conference on Information and Management Sciences /6./ place Lhasa dates 01.07.2007-06.07.2007 country CN reportyear 2008 RIV IN permalink http://hdl.handle.net/11104/0149057 arlyear 2007 mrcbU63 cav_un_epca*0087124 Proceedings of the 6th International Conference on Information and Management Sciences 1539-2023 289 295 San Luis Obispo California Polytechnic State University 2007 Series of Information and Management Sciences mrcbU67 Lee T. S. 340 mrcbU67 Liu Y. 340 mrcbU67 Zhao X. 340