Margin-Enhanced Maximum Mutual Information Estimation for Hidden Markov Models

被引:0
|
作者
Kim, Sungwoong [1 ]
Yun, Sungrack [1 ]
Yoo, Chang D. [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Div Elect Engn, Sch Elect Engn & Comp Sci, Taejon, South Korea
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A discriminative training algorithm to estimate continuous-density hidden Nlarkov model (CDHNIM) for automatic speech recognition is considered. The algorithm is based on the criterion, called margin-enhanced maximum mutual information (MEMMI), and it estimates the CDHMM parameters by maximizing the weighted sum of the maximum mutual information objective function and the large margin objective function. The MEMMI is motivated by the criterion used in such classifier as the soft margin support vector machine that maximizes the weighted sum of the empirical risk function and the margin-related generalization function. The algorithm is an iterative procedure, and at each stage, it updates the parameters by placing different weights on the utterances according to their log likelihood margins: incorrectly-classified (negative margin) utterances are emphasized more than correctly-classified utterances. The MEMMI leads to a simple objective function that can be optimized easily by a gradient ascent algorithm maintaining a probabilistic model. Experimental results show that the recognition accuracy of the MEMMI is better than other discriminative training criteria, such as the approximated maximum mutual information (AMMI), the maximum classification error (NICE), and the soft large margin estimation (SLME) on the TIDIGITS database.
引用
收藏
页码:1336 / 1340
页数:5
相关论文
共 50 条
  • [1] Maximum mutual information codebook mapping for discrete hidden Markov models
    Fontaine, V
    Ris, C
    Leich, H
    1996 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, CONFERENCE PROCEEDINGS, VOLS 1-6, 1996, : 593 - 596
  • [2] Maximum margin hidden Markov models for sequence classification
    Mutsam, Nikolaus
    Pernkopf, Franz
    PATTERN RECOGNITION LETTERS, 2016, 77 : 14 - 20
  • [3] Maximum spacing estimation for hidden Markov models
    Kristi Kuljus
    Bo Ranneby
    Statistical Inference for Stochastic Processes, 2025, 28 (1)
  • [4] Computation of mutual information from Hidden Markov Models
    Reker, Daniel
    Katzenbeisser, Stefan
    Hamacher, Kay
    COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2010, 34 (5-6) : 328 - 333
  • [5] Maximum a Posteriori Estimation of Coupled Hidden Markov Models
    Iead Rezek
    Michael Gibbs
    Stephen J. Roberts
    Journal of VLSI signal processing systems for signal, image and video technology, 2002, 32 : 55 - 66
  • [6] Maximum a posteriori estimation of Coupled Hidden Markov Models
    Rezek, I
    Gibbs, M
    Roberts, SJ
    JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2002, 32 (1-2): : 55 - 66
  • [7] Risk and information in the estimation of hidden Markov models
    Ramezani, VR
    Marcus, SI
    Fu, M
    PROCEEDINGS OF THE 2004 WINTER SIMULATION CONFERENCE, VOLS 1 AND 2, 2004, : 1596 - 1601
  • [9] Penalized maximum likelihood estimation for Gaussian hidden Markov models
    Alexandrovich, Grigory
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2016, 45 (20) : 6133 - 6148
  • [10] MAXIMUM LIKELIHOOD ESTIMATION IN HIDDEN MARKOV MODELS WITH INHOMOGENEOUS NOISE
    Diehn, Manuel
    Munk, Axel
    Rudolf, Daniel
    ESAIM-PROBABILITY AND STATISTICS, 2019, 23 (492-523) : 492 - 523