Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 75 for “"The expectation-maximization algorithm"”.

  1. Comparing Approaches to Initializing the Expectation-Maximization Algorithm

    The expectation-maximization (EM) algorithm is a widely utilized approach to max- imum likelihood estimation in the presence of missing data, this thesis focuses on its application within the model-based clustering framework. The performance of the EM algorithm can be highly dependent on how the …

    guelph Repository record for Comparing Approaches to Initializing the Expectation-Maximization Algorithm (opens in a new tab)

  2. The Application of the Expectation-Maximization Algorithm to the Identification of Biological Models

    With the onset of large-scale gene expression profiling, many researchers have turned their attention toward biological process modeling and system identification. The abundance of data available, while inspiring, is also daunting to interpret. Following the initial work of Rangel et al., we …

    vt Repository record for The Application of the Expectation-Maximization Algorithm to the Identification of Biological Models (opens in a new tab)

  3. A Fast Clustering Algorithm Merging The Expectation Maximization Algorithm and Markov Chain Monte Carlo

    … Learning that is usually solved using Likelihood Maximization methods, of which the Expectation-Maximization algorithm (EM) is the most common. In this work we present an algorithm merging Markov Chain Monte Carlo methods with the EM algorithm to find qualitatively better solutions for the …

    houston Repository record for A Fast Clustering Algorithm Merging The Expectation Maximization Algorithm and Markov Chain Monte Carlo (opens in a new tab)

  4. XPRIME-EM: Eliciting Expert Prior Information for Motif Exploration Using the Expectation-Maximization Algorithm

    Understanding the possible mechanisms of gene transcription regulation is a primary challenge for current molecular biologists. Identifying transcription factor binding sites (TFBSs), also called DNA motifs, is an important step in understanding these mechanisms. Furthermore, many human diseases …

    byu Repository record for XPRIME-EM: Eliciting Expert Prior Information for Motif Exploration Using the Expectation-Maximization Algorithm (opens in a new tab) Download PDF for XPRIME-EM: Eliciting Expert Prior Information for Motif Exploration Using the Expectation-Maximization Algorithm (opens in a new tab)

  5. Distributed Target Tracking and Synchronization in Wireless Sensor Networks

    … We derive a distributed fusion rule from Bayes' theorem and implement it via average consensus. We approximate each local estimate as a Gaussian mixture and develop a sampling-based approach to the nonlinear fusion of Gaussian mixtures. By using the sampling-based approach in the fusion of …

    wustl Repository record for Distributed Target Tracking and Synchronization in Wireless Sensor Networks (opens in a new tab)

  6. A probabilistic spellchecker

    This thesis studies graphical Models applied to the correction of words. More particularly, hidden Markov models and Markov chains will be used in order to build a probabilistic spellchecker. Several ways to cluster words will be introduced: the batch K-Means clustering algorithm with a specific …

    aston Repository record for A probabilistic spellchecker (opens in a new tab) Download PDF for A probabilistic spellchecker (opens in a new tab)

  7. Context-aware Mixture of Deep Neural Networks

    … is a neural network. It is trained using the expectation-maximization algorithm. It enables context-awareness as each component is pushed to give context-specific predictions. Such structure enables context uncertainty quantification as well. The effectiveness of alpha-beta network was …

    tamu Repository record for Context-aware Mixture of Deep Neural Networks (opens in a new tab)

  8. A Latent Class Model to Cluster Preferences

    In this study, we examine the heterogeneity in people’s preferences to understand the different perspectives of fairness that exist, from survey responses. A latent class model was built to identify unobservable subgroups amongst the respondents to examine the specific preference patterns of each …

    buffalo Repository record for A Latent Class Model to Cluster Preferences (opens in a new tab)

  9. Analysis of Four and Five-Way Data and Other Topics in Clustering

    Clustering is the process of finding underlying group structure in data. As the scale of data collection continues to grow, this “big data” phenomenon results in more complex data structures. These data structures are not always compatible with traditional clustering methods, making their use …

    mcmaster Repository record for Analysis of Four and Five-Way Data and Other Topics in Clustering (opens in a new tab)

  10. Iterative approximation of Markov process parameters in a model of large scale business purchases

    … vetting stages which must be satisfied prior to their resolution. This paper models the progression of sales projects through a company's sales pipeline via a stochastic process. The pipeline is viewed as a sequential Markov chain wherein each time step permits: failure, no movement, or …

    missouri Repository record for Iterative approximation of Markov process parameters in a model of large scale business purchases (opens in a new tab)

  11. Mixture Model Analysis with Misclassified Covariates: Methods and Applications

    … a method to enhance parameter estimation within the framework of mixture models, and mitigate the impact of misclassified covariates by utilizing them as surrogates in the Expectation-Maximization algorithm. Simulations consider both non-differential and differential misclassification with …

    calgary Repository record for Mixture Model Analysis with Misclassified Covariates: Methods and Applications (opens in a new tab)

  12. Unsupervised Classification for Skewed and Mixed-Type Data

    … to find underlying group structures in data. There are many well-established model-based techniques to analyze either categorical or continuous data in the clustering paradigm. However, there is a relative paucity of work for mixed-type data, especially mixed data where the continuous …

    mcmaster Repository record for Unsupervised Classification for Skewed and Mixed-Type Data (opens in a new tab)

  13. Longitudinal Data Clustering Via Kernel Mixture Models

    … and dependent bivariate longitudinal data. The Gaussian distribution in finite mixture models is replaced by the Gaussian and gamma kernel functions, and the expectation-maximization algorithm is used to estimate bandwidths and compute log-likelihood scores. For dependent bivariate …

    mcmaster Repository record for Longitudinal Data Clustering Via Kernel Mixture Models (opens in a new tab)

  14. Hybrid Hidden Markov Model and Generalized Linear Model for Auto Insurance Premiums

    We describe a new approach to estimate the pure premium for automobile insurance. Using the theory of hidden Markov models (HMM) we derive a Poisson-gamma HMM and a hybrid between HMMs and generalized linear models (HMM-GLM). The hidden state is meant to represent a driver's skill thus capturing an …

    concordia Download PDF for Hybrid Hidden Markov Model and Generalized Linear Model for Auto Insurance Premiums (opens in a new tab)

  15. Advances in Model-Based Clustering for Complex Data

    … observations using a finite mixture model. With the advancement of data technology, there is a growing interest among researchers in extending model-based clustering to accommodate different data types. To this end, this dissertation concerns the development of three novel model-based clustering …

    alabama Repository record for Advances in Model-Based Clustering for Complex Data (opens in a new tab)

  16. Estimation of parameters in the generalized graded unfolding model using a genetic algorithm

    In the current study, a genetic algorithm was used in conjunction with the expectation-maximization algorithm to estimate parameters in a polytomous unfolding IRT model known as the generalized graded unfolding model (GGUM). One advantage of using a genetic algorithm for IRT parameter estimation is …

    gatech Repository record for Estimation of parameters in the generalized graded unfolding model using a genetic algorithm (opens in a new tab)

  17. Multiple imputation and access to likelihood based tools in missing data problems

    … and maximum likelihood estimation (via the expectation- maximization algorithm) are two well-known methods readily used for analyzing data with missing values. While these two methods are often considered as being distinct from one another, multiple imputation (when using improper …

    unsw Repository record for Multiple imputation and access to likelihood based tools in missing data problems (opens in a new tab)

  18. Unsupervised Classification of Music Signals: Strategies Using Timbre and Rhythm

    This thesis describes the ideal properties of an adaptable music classification system based on unsupervised machine learning, and argues that such a system should be based on the fundamental musical properties of timbre, rhythm, melody and harmony. The first two properties and the signal features …

    vt Repository record for Unsupervised Classification of Music Signals: Strategies Using Timbre and Rhythm (opens in a new tab)

  19. An Integrated Item Response Model for Evaluating Individual Students' Growth in Educational Achievement

    … on individual test items to inferences about the form and quantity of changes in the student's underlying ability. This study proposed and investigated a single integrated model of underlying growth within an Item Response Theory framework as a potential alternative to this approach. A Monte …

    maryland Repository record for An Integrated Item Response Model for Evaluating Individual Students' Growth in Educational Achievement (opens in a new tab)

Page 1 of 4