Factorial hidden Markov models and the generalized backfitting algorithm

被引:6
|
作者
Jacobs, RA [1 ]
Jiang, WX
Tanner, MA
机构
[1] Univ Rochester, Dept Brain & Cognit Sci, Rochester, NY 14627 USA
[2] Cornell Univ, Sch Operat Res & Ind Engn, Ithaca, NY 14853 USA
[3] Northwestern Univ, Dept Stat, Evanston, IL 60208 USA
关键词
D O I
10.1162/08997660260293283
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Previous researchers developed new learning architectures for sequential data by extending conventional hidden Markov models through the use of distributed state representations. Although exact inference and parameter estimation in these architectures is computationally intractable, Ghahramani and Jordan (1997) showed that approximate inference and parameter estimation in one such architecture, factorial hidden Markov models (FHMMs), is feasible in certain circumstances. However, the learning algorithm proposed by these investigators, based on variational techniques, is difficult to understand and implement and is limited to the study of real-valued data sets. This chapter proposes an alternative method for approximate inference and parameter estimation in FHMMs based on the perspective that FHMMs are a generalization of a well-known class of statistical models known as generalized additive models (GAMs; Hastie & Tibshirani, 1990). Using existing statistical techniques for GAMs as a guide, we have developed the generalized backfitting algorithm. This algorithm computes customized error signals for each hidden Markov chain of an FHMM and then trains each chain one at a time using conventional techniques from the hidden Markov models literature. Relative to previous perspectives on FHMMs, we believe that the viewpoint taken here has a number of advantages. First, it places FHMMs on firm statistical foundations by relating them to a class of models that are well studied in the statistics community, yet it generalizes this class of models in an interesting way. Second, it leads to an understanding of how FHMMs can be applied to many different types of time-series data, including Bernoulli and multinomial data, not just data that are real valued. Finally, it leads to an effective learning procedure for FHMMs that is easier to understand and easier to implement than existing learning procedures. Simulation results suggest that FHMMs trained with the generalized backfitting algorithm are a practical and powerful tool for analyzing sequential data.
引用
下载
收藏
页码:2415 / 2437
页数:23
相关论文
共 50 条
  • [1] Unsupervised Energy Disaggregation with Factorial Hidden Markov Models Based on Generalized Backfitting Algorithm
    Wang, Lanruo
    Luo, Xianjue
    Zhang, Wei
    2013 IEEE INTERNATIONAL CONFERENCE OF IEEE REGION 10 (TENCON), 2013,
  • [2] Factorial hidden Markov models
    Ghahramani, Z
    Jordan, MI
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 8: PROCEEDINGS OF THE 1995 CONFERENCE, 1996, 8 : 472 - 478
  • [3] Factorial Hidden Markov Models
    Zoubin Ghahramani
    Michael I. Jordan
    Machine Learning, 1997, 29 : 245 - 273
  • [4] Factorial hidden Markov models
    Ghahramani, Z
    Jordan, MI
    MACHINE LEARNING, 1997, 29 (2-3) : 245 - 273
  • [5] Supertagging with factorial Hidden Markov models?
    Ramanujam, Srivatsan
    Baldridge, Jason
    PACLIC 23 - Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation, 2009, 2 : 795 - 802
  • [6] Factorial hidden Markov models for gait recognition
    Chen, Changhong
    Liang, Jimin
    Hu, Haihong
    Jiao, Licheng
    Yang, Xin
    ADVANCES IN BIOMETRICS, PROCEEDINGS, 2007, 4642 : 124 - +
  • [7] Representability of human motions by factorial hidden Markov models
    Kulic, Dana
    Takano, Wataru
    Nakamura, Yoshihiko
    2007 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-9, 2007, : 2394 - 2399
  • [8] FactorialHMM: fast and exact inference in factorial hidden Markov models
    Schweiger, Regev
    Erlich, Yaniv
    Carmi, Shai
    BIOINFORMATICS, 2019, 35 (12) : 2162 - 2164
  • [9] Soft failure detection using factorial hidden Markov models
    Bouchard, Guillaume
    Andreoli, Jean-Marc
    ICMLA 2007: SIXTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS, PROCEEDINGS, 2007, : 160 - 165
  • [10] Augmented Ensemble MCMC sampling in Factorial Hidden Markov Models
    Martens, Kaspar
    Titsias, Michalis K.
    Yau, Christopher
    22ND INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 89, 2019, 89