Learning genetic population structures using minimization of stochastic complexity

DOI10.3390/E12051102zbMATH Open1229.92038OpenAlexW2019096419MaRDI QIDQ653380FDOQ653380

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

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

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)

Cites Work

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

Cited In (2)

• Random partition models and exchangeability for Bayesian identification of population struc\-ture
• Bayesian analysis of population structure based on linked molecular information

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)