OF THE DISSERTATION Networks of Mixture Blocks for Non Parametric Bayesian Models with Applications By Ian Porteous Doctor of Philosophy in Information and Computer Science University of California, Irvine, 2010 Professor Max Welling, Chair This study brings together Bayesian networks, topic models, hierarchical Bayes modeling and nonparametric Bayesian methods to build a framework for efficien...

OF THE DISSERTATION Mixture Block Methods for Non Parametric Bayesian Models with Applications By Ian Porteous Doctor of Philosophy in Computer Science University of California, Irvine, 2010 Professor Max Welling, Chair This study brings together Bayesian networks, topic models, hierarchical Bayes modeling and nonparametric Bayesian methods to build a framework for efficiently designing and imp...

We present a generic Bayesian framework for the peptide and protein identification in proteomics, and provide a unified interpretation for the database searching and the de novo peptide sequencing approaches that are used in peptide identification. We describe several probabilistic graphical models and a variety of prior distributions that can be incorporated into the Bayesian framework to mode...

A Bayesian network can be regarded as a summary of a domain expert’s experience with an implicit population. A database can be regarded as a detailed documentation of such an experience with an explicit population. This connection between Bayesian networks and databases is well recognized and have been pursued for knowledge acquisition [1, 2, 11]. Existing databases are treated as information r...

Bayesian models provide a framework for probabilistic modelling of complex datasets. However, many of such models are computationally demanding especially in the presence of large datasets. On the other hand, in sensor network applications, statistical (Bayesian) parameter estimation usually needs distributed algorithms, in which both data and computation are distributed across the nodes of the...

A probabilistic evolutionary framework is presented and shown to be applicable to both learning and optimization problems. In this framework, evolutionary computation is viewed as Bayesian inference that iteratively updates the posterior distribution of a population from the prior knowledge and observation of new individuals to find an individual with the maximum posterior probability. Theoreti...