See this document in CiteSeerX!

Equivalence and Reduction of Hidden Markov Models  (Make Corrections)  
B. Vijay



  Home/Search   Context   Related

 
View or download:
mit.edu/aipublications...AITR1370.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mit.edu/publications/pubsD...pubs (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Hidden Markov Models are one of the most popular and successful techniques used in statistical pattern recognition. However, they are not well understood on a fundamental level. For example, we do not knowhowtocharacterize the class of processes that can be well approximated by HMMs. This thesis tries to uncover the source of the intrinsic expressiveness of HMMs by studying when and whytwo models may represent the same stochastic process. Define two statistical models to be equivalent if they... (Update)

Active bibliography (related documents):   More   All
2.8:   Equivalence and Reduction of Hidden Markov Models - Balasubramanian (1993)   (Correct)
0.7:   Characterizing Distributions of Stochastic Processes By Linear.. - Jaeger (1999)   (Correct)
0.4:   Appendix A Notation - Processes Alphabet   (Correct)

Similar documents based on text:   More   All
0.3:   MAEP: A Standard Communication Protocol for Artificial.. - Sashima, Kurumatani (2002)   (Correct)
0.2:   From Genetic Algorithms To Efficient Optimization - Yuret (1994)   (Correct)
0.2:   Maxwell's demon, rectifiers, and the second law: Computer.. - Skordos (1992)   (Correct)

BibTeX entry:   (Update)

@techreport{ balasubramanian93equivalence,
    author = "Vijay Balasubramanian",
    title = "Equivalence and Reduction of Hidden Markov Models",
    number = "AITR-1370",
    pages = "111",
    year = "1993",
    url = "citeseer.ist.psu.edu/530769.html" }
Citations (may not include all citations):
1535   Cambridge University Press (context) - Press, Flannery et al. - 1990
448   A New Polynomial Time Algorithm For Linear Programming (context) - Karmarkar - 1984
73   Introduction to Probabilistic Automata (context) - Paz - 1971
57   Large-Vocabulary Speaker Independent Continuous Speech Recog.. (context) - Lee - 1988
50   Freeman and Company (context) - Chv'atal, Programming - 1980
45   Artificial Intelligence Laboratory (context) - Poggio, Girosi et al. - 1989
37   Finite Markov Processes and Their Applications (context) - Iosifescu - 1980
30   Hidden Markov Models for Speech Recognition (context) - Juang, Rabiner - 1991
10   Identifiability of Hidden Markov Information Sources and The.. (context) - Ito, Amari et al.
9   The Identifiability Problem For Functions of Finite Markov C.. (context) - Gilbert - 1959
8   Acoustic Markov Models Used In The TangoraSpeech Recognition.. (context) - Bahl, Brown et al.
6   Document Image Decoding Using Markov Sources (context) - Kopec, Chou - 1992
6   The Identifiability Problem for Functions of Finite Markov C.. (context) - Blackwell, Koopmans - 1957
6   Markov Processes - Structure and Asymptotic Behaviour (context) - Rosenblatt - 1971
5   A Markovian Function of A Markov Chain (context) - Burke, Rosenblatt - 1958
3   Functions of Finite Markov Chains (context) - Dharmadhikari - 1963
2   Van Nostrand Company Inc (context) - Kemeney, Snell et al. - 1965
2   State Reduction in Hidden Markov Chains Used for Speech Reco.. (context) - Kamp - 1985
2   Part-of-Speech Tagging Using a Hidden Markov Model (context) - Kupiec - 1990
2   Modelling and Learning in Speech Recognition: The Relationsh.. (context) - Niles - 1990
1   AnIntroduction to Hidden Markov Models (context) - Rabiner, Juang - 1986
1   Sufficient Conditions For A Stationary Process ToBeAFunction.. (context) - Dharmadhikari - 1963
1   A Polynomial Time Algorithm for the EquivalenceofProbabilist.. (context) - Tzeng
1   SPlitting A Single State Of A Stationary Process Into Markov.. (context) - Dharmadhikari - 1968
1   AnIntroduction to the Application of the Theory of Probabili.. (context) - Levinson, Rabiner et al. - 1983
1   Functions of Finite Markov Chains and Exponential TypeProces.. (context) - Bodreau - 1968

Documents on the same site (http://www.ai.mit.edu/publications/pubsDB/pubs.html):   More
Corpus-based Techniques for Word Sense Disambiguation - Levow (1997)   (Correct)
Presentation Based User Interfaces - Ciccarelli (1984)   (Correct)
The Revised Revised Report on Scheme or An UnCommon Lisp - Abelson, Adams, Bartley, .. (1985)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC