Training Algorithms for Hidden Markov Models using Entropy Based Distance Functions
暂无分享,去创建一个
[1] L. Baum,et al. Statistical Inference for Probabilistic Functions of Finite State Markov Chains , 1966 .
[2] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[3] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[4] Andreas Stolcke,et al. Hidden Markov Model} Induction by Bayesian Model Merging , 1992, NIPS.
[5] Pierre Baldi,et al. Smooth On-Line Learning Algorithms for Hidden Markov Models , 1994, Neural Computation.
[6] Dana Ron,et al. On the learnability and usage of acyclic probabilistic finite automata , 1995, COLT '95.
[7] Michael I. Jordan,et al. On Convergence Properties of the EM Algorithm for Gaussian Mixtures , 1996, Neural Computation.
[8] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..