Search for dissertations about: "Probabilistic Models"
Showing result 1 - 5 of 220 swedish dissertations containing the words Probabilistic Models.
-
1. Perspectives on Probabilistic Graphical Models
Abstract : Probabilistic graphical models provide a natural framework for the representation of complex systems and offer straightforward abstraction for the interactions within the systems. Reasoning with help of probabilistic graphical models allows us to answer inference queries with uncertainty following the framework of probability theory. READ MORE
-
2. Probabilistic Sequence Models with Speech and Language Applications
Abstract : Series data, sequences of measured values, are ubiquitous. Whenever observations are made along a path in space or time, a data sequence results. To comprehend nature and shape it to our will, or to make informed decisions based on what we know, we need methods to make sense of such data. READ MORE
-
3. Probabilistic Modelling of Hearing : Speech Recognition and Optimal Audiometry
Abstract : Hearing loss afflicts as many as 10\% of our population.Fortunately, technologies designed to alleviate the effects ofhearing loss are improving rapidly, including cochlear implantsand the increasing computing power of digital hearing aids. Thisthesis focuses on theoretically sound methods for improvinghearing aid technology. READ MORE
-
4. Draw control strategy for sublevel caving mines : A probabilistic approach
Abstract : Sublevel caving is an underground mass mining method used for extracting different types of ores from the earth crust. Mines using sublevel caving (SLC) as the primary mining method are generally highly mechanized with standardized and independent unit operations. READ MORE
-
5. Bayesian inference in probabilistic graphical models
Abstract : This thesis consists of four papers studying structure learning and Bayesian inference in probabilistic graphical models for both undirected and directed acyclic graphs (DAGs).Paper A presents a novel algorithm, called the Christmas tree algorithm (CTA), that incrementally construct junction trees for decomposable graphs by adding one node at a time to the underlying graph. READ MORE