Number of the records: 1
Mixtures of Product Components versus Mixtures of Dependence Trees
- 1.
SYSNO ASEP 0452538 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title Mixtures of Product Components versus Mixtures of Dependence Trees Author(s) Grim, Jiří (UTIA-B) RID, ORCID
Pudil, P. (CZ)Number of authors 2 Source Title Computational Intelligence. - Cham : Springer, 2016 - ISBN 978-3-319-26393-9 Pages s. 365-382 Number of pages 18 s. Publication form Print - P Action IJCCI 2014 - International Joint Conference on Computational Intelligence (Rome/Italy) Event date 22.10.2014-24.10.2014 VEvent location Rome Country IT - Italy Event type WRD Language eng - English Country CH - Switzerland Keywords Product mixtures ; Mixtures of Dependence Trees ; EM algorithm Subject RIV BD - Theory of Information R&D Projects GA14-02652S GA ČR - Czech Science Foundation (CSF) Institutional support UTIA-B - RVO:67985556 UT WOS 000391072100022 EID SCOPUS 84949894891 DOI 10.1007/978-3-319-26393-9_22 Annotation 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. Workplace Institute of Information Theory and Automation Contact Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Year of Publishing 2016
Number of the records: 1