Mixtures of Product Components versus Mixtures of Dependence Trees
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F15%3A00452538" target="_blank" >RIV/67985556:_____/15:00452538 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-26393-9_22" target="_blank" >http://dx.doi.org/10.1007/978-3-319-26393-9_22</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-26393-9_22" target="_blank" >10.1007/978-3-319-26393-9_22</a>
Alternative languages
Result language
angličtina
Original language name
Mixtures of Product Components versus Mixtures of Dependence Trees
Original language description
Mixtures of product components assume independence of variables given the index of the component. They can be efficiently estimated from data by means of EM algorithm and have some other useful properties. On the other hand, by considering mixtures of dependence trees, we can explicitly describe the statistical relationship between pairs of variables at the level of individual components and therefore approximation power of the resulting mixture may essentially increase. However, we have found in application to classification of numerals that both models perform comparably and the contribution of dependence-tree structures to the log-likelihood criterion decreases in the course of EM iterations. Thus the optimal estimate of dependence-tree mixture tends to reduce to a simple product mixture model.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA14-02652S" target="_blank" >GA14-02652S: Advanced measurement of material appearance</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Computational Intelligence
ISBN
978-3-319-26393-9
ISSN
—
e-ISSN
—
Number of pages
18
Pages from-to
365-382
Publisher name
Springer
Place of publication
Cham
Event location
Rome
Event date
Oct 22, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—