Learning Genetic Population Structures Using Minimization of Stochastic Complexity

Entropy

Jukka Corander¹  Mats Gyllenberg¹ 

[1] Department of Mathematics and statistics, University of Helsinki, P.O.Box 68, FIN-00014 University of Helsinki, Finland

关键词: factorization of multivariate distributions;    finite mixture models;    Minimum Description Length;    population genetics;    statistical learning;    structured population;   

DOI  :  10.3390/e12051102

来源: mdpi

【 摘 要 】

Considerable research efforts have been devoted to probabilistic modeling of genetic population structures within the past decade. In particular, a wide spectrum of Bayesian models have been proposed for unlinked molecular marker data from diploid organisms. Here we derive a theoretical framework for learning genetic population structure of a haploid organism from bi-allelic markers for which potential patterns of dependence are a priori unknown and to be explicitly incorporated in the model. Our framework is based on the principle of minimizing stochastic complexity of an unsupervised classification under tree augmented factorization of the predictive data distribution. We discuss a fast implementation of the learning framework using deterministic algorithms.

【 授权许可】

CC BY   
© 2010 by the authors; licensee MDPI, Basel, Switzerland.