The space of Bayesian network structures is forbiddingly large and hence numerous techniques have been developed to prune this search space, but without eliminating the optimal structure. Such techniques are critical for structure learning to scale to larger datasets with more variables. Prior works exploited properties of the MDL score to prune away large regions of the search space that can b...

This is an expository paper on the latest results in the theory of stochastic complexity and the associated MDL principle with special interest in modeling problems arising in machine learning. As an illustration we discuss the problem of designing MDL decision trees, which are meant to improve the earlier designs in two ways: First, by use of the sharper formula for the stochastic complexity a...

Meiosis is the cell division that halves the genetic component of diploid cells to form gametes or spores. To achieve this, meiotic cells undergo a radical spatial reorganisation of chromosomes. This reorganisation is a prerequisite for the pairing of parental homologous chromosomes and the reductional division, which halves the number of chromosomes in daughter cells. Of particular note is the...

the relation between single nucleotide polymorphisms (snps) and some diseases has been concerned by many researchers. also the missing snps are quite common in genetic association studies. hence, this article investigates the relation between existing snps in dnmt1 of human chromosome 19 with colorectal cancer. this article aims is to presents an imputation method for missing snps not at random...

multi-criteria shortest path problems (mspp) are called as np-hard. for mspps, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. this paper describes the development ...

this study emphasized the ability of genetic algorithm and cellular automate to simulate urban land use changes by integrating adaptive model. the most important part of modeling is to define transition rules.  in this research, a cellular automata model in dinamica ego software was used coupled with genetic algorithm. according to disability of the software for manipulating large number of var...

We propose a new method of automatically creating nonuniform context-dependent HMM topologies by using the Minimum Description Length (MDL) criterion. Phonetic decision tree clustering is widely used, based on the Maximum Likelihood (ML) criterion, and creates only contextual variations. However, it also needs to empirically predetermine control parameters for use as stop criteria, for example,...

The problem of discovering complex control policies for continuous tasks is often best addressed by decomposing the policy into several simpler parts. While a genetic algorithm usually decomposes the task by encoding a chromosome over multiple genes, it faces the difficult credit assignment problem of evaluating how a single allele in a chromosome contributes to the full solution. Typically a s...