Minimization Of Stochastic Complexity Research Articles

Learning Genetic Population Structures Using Minimization of Stochastic Complexity

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.

Sliding window discretization: a new method for multiple band matching of bacterial genotyping fingerprints

Microbiologists have traditionally applied hierarchical clustering algorithms as their mathematical tool of choice to unravel the taxonomic relationships between micro-organisms. However, the interpretation of such hierarchical classifications suffers from being subjective, in that a variety of ad hoc choices must be made during their construction. On the other hand, the application of more profound and objective mathematical methods—such as the minimization of stochastic complexity—for the classification of bacterial genotyping fingerprints data is hampered by the prerequisite that such methods only act upon vectorized data. In this paper we introduce a new method, coined sliding window discretization, for the transformation of genotypic fingerprint patterns into binary vector format. In the context of an extensive amplified fragment length polymorphism (AFLP) data set of 507 strains from the Vibrionaceae family that has previously been analysed, we demonstrate by comparison with a number of other discretization methods that this new discretization method results in minimal loss of the original information content captured in the banding patterns. Finally, we investigate the implications of the different discretization methods on the classification of bacterial genotyping fingerprints by minimization of stochastic complexity, as it is implemented in the BinClass software package for probabilistic clustering of binary vectors. The new taxonomic insights learned from the resulting classification of the AFLP patterns will prove the value of combining sliding window discretization with minimization of stochastic complexity, as an alternative classification algorithm for bacterial genotyping fingerprints.

New Methods for the Analysis of Binarized BIOLOG GN Data of Vibrio species: Minimization of Stochastic Complexity and Cumulative Classification

We apply minimization of stochastic complexity and the closely related method of cumulative classification to analyse the extensively studied BIOLOG GN data of Vibrio spp. Minimization of stochastic complexity provides an objective tool of bacterial taxonomy as it produces classifications that are optimal from the point of view of information theory. We compare the outcome of our results with previously published classifications of the same data set. Our results both confirm earlier detected relationships between species and discover new ones.

Enterobacteriaceae Taxonomy Approached by Minimization of Stochastic Complexity

We discuss the taxonomy of Enterobacteriaceae in the light of classification by minimization of stochastic complexity (SC). A classification which minimizes SC is optimal from the point of view of information theory. It was found that the SC-minimizing classification of a large database of strains of Enterobacteriaceae resulted in structures which correspond well to the conclusions of experts on the taxonomy of Enterobacteriaceae. The approach based on minimization of SC can therefore be considered as useful in bacterial taxonomy.

Classification of Enterobacteriaceae by minimization of stochastic complexity.

A new method for classifying bacteria is presented and applied to a large set of biochemical data for the Enterobacteriaceae. The method minimizes the bits needed to encode the classes and the items or, equivalently, maximizes the information content of the classification. The resulting taxonomy of Enterobacteriaceae corresponds well to the general structure of earlier classifications. Minimization of stochastic complexity can be considered as a useful tool to create bacterial classifications that are optimal from the point of view of information theory.