scispace - formally typeset
Open AccessJournal Article

A gentle tutorial of the em algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models

Reads0
Chats0
TLDR
In this paper, the authors describe the EM algorithm for finding the parameters of a mixture of Gaussian densities and a hidden Markov model (HMM) for both discrete and Gaussian mixture observation models.
Abstract
We describe the maximum-likelihood parameter estimation problem and how the ExpectationMaximization (EM) algorithm can be used for its solution. We first describe the abstract form of the EM algorithm as it is often given in the literature. We then develop the EM parameter estimation procedure for two applications: 1) finding the parameters of a mixture of Gaussian densities, and 2) finding the parameters of a hidden Markov model (HMM) (i.e., the Baum-Welch algorithm) for both discrete and Gaussian mixture observation models. We derive the update equations in fairly explicit detail but we do not prove any convergence properties. We try to emphasize intuition rather than mathematical rigor.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Robot learning from human demonstration with remote lead hrough teaching

TL;DR: Remote Lead Through Teaching (RLTT) is proposed to robot learn some tasks from human knowledge and skill to transfer the human skills directly into robot applications.
Journal ArticleDOI

An Adaptive Markov Chain Monte Carlo Approach to Time Series Clustering of Processes with Regime Transition Behavior

TL;DR: A numerical framework for clustering of time series via a Markov chain Monte Carlo (MCMC) method that combines concepts from recently introduced variational time series analysis and regularized clustering functional minimization to address the two main problems of the existent clustering methods.
Journal ArticleDOI

Symbolic Analysis of Programmable Logic Controllers

TL;DR: A novel approach to the symbolic analysis of PLC systems, which provides automated analysis of both uncertainty calculations and performance measurements, without the need for expensive simulations.
Journal ArticleDOI

Learning content-specific codebooks for blind quality assessment of screen content images

TL;DR: A novel blind quality assessment method for screen content images (SCIs) by learning content-specific codebooks that delivers low computational complexity, making it well suitable for real-time applications.
Proceedings Article

Truly Batch Model-Free Inverse Reinforcement Learning about Multiple Intentions

TL;DR: This paper first cast the single IRL problem as a constrained likelihood maximization and then uses this formulation to cluster agents based on the likelihood of the assignment and can efficiently solve, without interactions with the environment, both the IRL and the clustering problem.
References
More filters
Book

The Nature of Statistical Learning Theory

TL;DR: Setting of the learning problem consistency of learning processes bounds on the rate of convergence ofLearning processes controlling the generalization ability of learning process constructing learning algorithms what is important in learning theory?
Book

Matrix computations

Gene H. Golub

Statistical learning theory

TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
Book

The Fractal Geometry of Nature

TL;DR: This book is a blend of erudition, popularization, and exposition, and the illustrations include many superb examples of computer graphics that are works of art in their own right.