Publication details

Mixtures of Product Components versus Mixtures of Dependence Trees

Conference Paper (international conference)

Grim Jiří, Pudil P.

serial: Computational Intelligence, p. 365-382

action: IJCCI 2014 - International Joint Conference on Computational Intelligence (Rome/Italy), (Rome, IT, 22.10.2014-24.10.2014)

project(s): GAP403/12/1557, GA ČR, GA14-02652S, GA ČR

keywords: Product mixtures, Mixtures of Dependence Trees, EM algorithm

preview: Download

abstract (eng):

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.