메뉴 건너뛰기




Volumn 2134, Issue , 2001, Pages 75-90

Designing the minimal structure of hidden Markov model by bisimulation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; MARKOV PROCESSES; PATTERN RECOGNITION; STRUCTURAL OPTIMIZATION; TRELLIS CODES;

EID: 84958677243     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44745-8_6     Document Type: Conference Paper
Times cited : (7)

References (26)
  • 1
    • 0024610919 scopus 로고
    • A tutorial on Hidden Markov Models and Selected Applications in Speech Recognition
    • Rabiner, L.R.: A tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proc. of IEEE 77(2) (1989) 257–286.
    • (1989) Proc. of IEEE , vol.77 , Issue.2 , pp. 257-286
    • Rabiner, L.R.1
  • 2
    • 0000353178 scopus 로고
    • A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains
    • Baum, L.E., Petrie, T.E, Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Annals of Math. Statistics. 41(1) (1970) 164–171.
    • (1970) Annals of Math. Statistics , vol.41 , Issue.1 , pp. 164-171
    • Baum, L.E.1    Petrie, T.E.2    Soules, G.3    Weiss, N.4
  • 3
    • 0001862769 scopus 로고
    • An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes
    • Baum, L.E.: An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes. Inequality 3 (1970) 1–8.
    • (1970) Inequality , vol.3 , pp. 1-8
    • Baum, L.E.1
  • 4
    • 0028428257 scopus 로고
    • Hidden Markov Models applied to on-line handwritten isolated character recognition
    • Veltman, S.R., Prasad, R.: Hidden Markov Models applied to on-line handwritten isolated character recognition. IEEE Trans. Image Proc., 3(3) (1994) 314–318.
    • (1994) IEEE Trans. Image Proc , vol.3 , Issue.3 , pp. 314-318
    • Veltman, S.R.1    Prasad, R.2
  • 5
    • 33244455151 scopus 로고
    • Hidden Markov Chains and the analysis of genome structure
    • Churchill, G.A.: Hidden Markov Chains and the analysis of genome structure. Computers & Chemistry 16 (1992) 107–115.
    • (1992) Computers & Chemistry , vol.16 , pp. 107-115
    • Churchill, G.A.1
  • 11
    • 0002297358 scopus 로고
    • Hidden Markov Model Induction by Bayesian Model Merging
    • Hanson, S.J., Cowan, J.D., Giles, C.L. eds
    • Stolcke, A., Omohundro, S.: Hidden Markov Model Induction by Bayesian Model Merging. Hanson, S.J., Cowan, J.D., Giles, C.L. eds. Advances in Neural Information Processing Systems 5 (1993) 11–18.
    • (1993) Advances in Neural Information Processing Systems , vol.5 , pp. 11-18
    • Stolcke, A.1    Omohundro, S.2
  • 12
    • 0000148207 scopus 로고    scopus 로고
    • An entropic estimator for structure discovery
    • Kearns, M.S., Solla, S.A., Cohn, D.A. eds
    • Brand, M.: An entropic estimator for structure discovery. Kearns, M.S., Solla, S.A., Cohn, D.A. eds. Advances in Neural Information Processing Systems 11 (1999).
    • (1999) Advances in Neural Information Processing Systems , pp. 11
    • Brand, M.1
  • 16
    • 0025432462 scopus 로고
    • CCS Expressions, Finite State Processes, and Three Problems of Equivalence
    • Kanellakis, P.C., Smolka, S.A.: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation, 86(1) (1990) 43–68.
    • (1990) Information and Computation , vol.86 , Issue.1 , pp. 43-68
    • Kanellakis, P.C.1    Smolka, S.A.2
  • 17
    • 84947933592 scopus 로고    scopus 로고
    • Bounded Hyperset Theory and Web-like Data Bases
    • Lisitsa, A., Sazanov, V.: Bounded Hyperset Theory and Web-like Data Bases. In 5th Kurt Gödel Colloquium. LNCS 1289 (1997) 172–185.
    • (1997) 5Th Kurt Gödel Colloquium. LNCS , vol.1289 , pp. 172-185
    • Lisitsa, A.1    Sazanov, V.2
  • 19
    • 0023566630 scopus 로고
    • Three Partition refinement algorithms
    • Paige, R., Tarjan, R. E.: Three Partition refinement algorithms. SIAMJournal on Computing 16(6) (1987) 973–989.
    • (1987) Siamjournal on Computing , vol.16 , Issue.6 , pp. 973-989
    • Paige, R.1    Tarjan, R.E.2
  • 20
    • 0004235635 scopus 로고
    • PhD dissertation, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzoek van Exacte Wetenschappen
    • Van Benthem, J.: Modal Correspondence Theory. PhD dissertation, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzoek van Exacte Wetenschappen, (1978) 1-148.
    • (1978) Modal Correspondence Theory , pp. 1-148
    • Van Benthem, J.1
  • 21
    • 0033309964 scopus 로고    scopus 로고
    • Gene discovery in DNA sequences
    • Salzberg, S.L.: Gene discovery in DNA sequences. IEEE Intelligent Systems 14(6) (1999) 44–48.
    • (1999) IEEE Intelligent Systems , vol.14 , Issue.6 , pp. 44-48
    • Salzberg, S.L.1
  • 25
    • 0032205609 scopus 로고    scopus 로고
    • Bayesian Approaches to gaussian mixture modelling
    • Roberts, S., Husmeier, D., Rezek, I., Penny, W.: Bayesian Approaches to gaussian mixture modelling, IEEE Trans. on P.A.M.I., 20(11) (1998) 1133–1142.
    • (1998) IEEE Trans. on P.A.M.I , vol.20 , Issue.11 , pp. 1133-1142
    • Roberts, S.1    Husmeier, D.2    Rezek, I.3    Penny, W.4
  • 26
    • 84969357963 scopus 로고
    • Estimating the dimension of a model
    • Schwarz, G.: Estimating the dimension of a model, The Annals of Statistics, 6(2) (1978) 461–464.
    • (1978) The Annals of Statistics , vol.6 , Issue.2 , pp. 461-464
    • Schwarz, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.