Learning genetic population structures using minimization of stochastic complexity

DOI10.3390/E12051102MaRDI QIDQ653380zbMATH OpenOpenAlexFDO

Authors Jukka Corander, Mats Gyllenberg, Timo Koski

Publication date 9 January 2012

Published in Entropy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3390/e12051102

zbMATH Keywords

population geneticsstatistical learningfinite mixture modelsstructured populationminimum description lengthfactorization of multivariate distributions

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Genetics and epigenetics (92D10) Systems biology, networks (92C42)

Recommendations

• Random partition models and exchangeability for Bayesian identification of population struc\-ture
• Latent variable models in population genetics
• Learning Hierarchical Bayesian Networks for Genome-Wide Association Studies
• Bayesian analysis of population structure based on linked molecular information
• Modeling population structure under hierarchical Dirichlet processes

Cites work

• scientific article; zbMATH DE number 5957252 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 5187524 (Why is no real title available?)
• A decision-theoretic extension of stochastic complexity and its applications to learning
• Approximating discrete probability distributions with dependence trees
• Bayesian analysis of population structure based on linked molecular information
• Bayesian network classifiers
• Bayesian predictive identification and cumulative classification of bacteria
• Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy
• Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy
• Classification of binary vectors by stochastic complexity.
• Comments on approximating discrete probability distributions with dependence trees
• Estimating the dimension of a model
• Fisher information and stochastic complexity
• Jeffreys' prior is asymptotically least favorable under entropy risk
• Minimum description length induction, Bayesianism, and Kolmogorov complexity
• On the choice of a model to fit data from an exponential family
• Probabilistic Networks and Expert Systems
• Random partition models and exchangeability for Bayesian identification of population struc\-ture
• Stochastic complexity in learning

Cited in

(7)

• A beta-mixture model for assessing genetic population structure
• Latent variable models in population genetics
• Random partition models and exchangeability for Bayesian identification of population struc\-ture
• The cumulative effect of genetic markers on classification performance: insights from simple models
• Deep learning in population genetics: prediction and explanation of selection of a population
• Bayesian analysis of population structure based on linked molecular information
• A rigorous analysis of population stratification with limited data

Describes a project that uses

Uses Software

• STRUCTURE

This page was built for publication: Learning genetic population structures using minimization of stochastic complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653380)