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 8 of 8 for “"Baum-Welch Algorithm"”.
-
Experiments with hidden Markov models
… chains with generative transitions and the Baum-Welch algorithm. We explore generating the hypothesis model in various ways. We use the hypothesis model as the original model. And we investigate the feasibility of implementing a sequential version of the Baum-Welch algorithm. This research …
-
Two new approaches for learning Hidden Markov Models
… to infer these hidden variables has been the Baum-Welch algorithm. This thesis utilizes insights from two related fields. The first insight is from Angluin's seminal paper on learning regular sets from queries and counterexamples, which produces a simple and intuitive algorithm that …
-
Parameter estimation in HMMs with guaranteed convergence
The EM (Expectation-Maximization) algorithm is a heuristic for parameter estimation in statistical models with latent variables, where explicit computation of the maximum likelihood estimate (MLE) is infeasible. Although widely used in practice, the theoretical guarantees associated with EM are …
-
One-vector representations of stochastic signals for pattern recognition
… space, as the majority of pattern recognition algorithms by design handle stochastic signals having a one-vector representation. More importantly, a one-vector representation naturally allows for optimal distance metric learning from the data, which generally accounts for significant …
-
An integrated performance model learning and planning approach for optimal infrastructure facility maintenance under partial observability
… estimate of performance model using the Baum-Welch algorithm. Both offline and online versions of the learning algorithm are presented. The probing-optimizing dichotomy, also known as exploration-exploitation dilemma, in choosing between the best strategy based on the past knowledge of …
-
Automatic Phoneme Recognition with Segmental Hidden Markov Models
… (HMM) based phoneme models are trained using the Baum-Welch re-estimation procedure. Recognition and segmentation of the phonemes in the continuous speech is performed by a Segmental Viterbi Search on a Segmental Ergodic HMM for the phoneme states. We describe in detail the three phases of the …
-
Android Application Install-time Permission Validation and Run-time Malicious Pattern Detection
… size by adding game applications, to optimize Baum-Welch algorithm parameters, and to balance the size of the Intent sequence. To better emulate the participant's usage, some popular applications can be selected in advance, and the remainder can be randomly chosen.
-
Iterative Decoding and Channel Estimation over Hidden Markov Fading Channels
… maximum likelihood sequence estimation (MLSE) algorithms or maximum <I> a posteriori</I> (MAP) algorithms operating over the trellis defined by the MFC can be used for channel estimation. Furthermore, the thesis illustrates sequential and decision-directed techniques for using the …