A canonical representation for aggregated Markov processes

被引:16
作者
Larget, B [1 ]
机构
[1] Duquesne Univ, Dept Math & Comp Sci, Pittsburgh, PA 15282 USA
关键词
aggregated Markov process; canonical representation; hidden Markov model; identifiability; equivalence; minimal parameterization;
D O I
10.1017/S0021900200014972
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
A deterministic function of a Markov process is called an aggregated Markov process. We give necessary and sufficient conditions for the equivalence of continuous-time aggregated Markov processes. For both discrete- and continuous-time, we show that any aggregated Markov process which satisfies mild regularity conditions can be directly converted to a canonical representation which is unique for each class of equivalent models, and furthermore, is a minimal parameterization of all that can be identified about the underlying Markov process. Hidden Markov models on finite state spaces may be framed as aggregated Markov processes by expanding the state space and thus also have canonical representations.
引用
收藏
页码:313 / 324
页数:12
相关论文
共 11 条
[1]   HIDDEN MARKOV-MODELS OF BIOLOGICAL PRIMARY SEQUENCE INFORMATION [J].
BALDI, P ;
CHAUVIN, Y ;
HUNKAPILLER, T ;
MCCLURE, MA .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1994, 91 (03) :1059-1063
[2]   ON THE IDENTIFIABILITY PROBLEM FOR FUNCTIONS OF FINITE MARKOV-CHAINS [J].
BLACKWELL, D ;
KOOPMANS, L .
ANNALS OF MATHEMATICAL STATISTICS, 1957, 28 (04) :1011-1015
[3]   A hidden Markov Model approach to variation among sites in rate of evolution [J].
Felsenstein, J ;
Churchill, GA .
MOLECULAR BIOLOGY AND EVOLUTION, 1996, 13 (01) :93-104
[4]   ON AGGREGATED MARKOV-PROCESSES [J].
FREDKIN, DR ;
RICE, JA .
JOURNAL OF APPLIED PROBABILITY, 1986, 23 (01) :208-214
[5]  
FREDKIN DR, 1985, P BERKELEY C HONOR J, V1, P269
[6]   ON THE IDENTIFIABILITY PROBLEM FOR FUNCTIONS OF FINITE MARKOV-CHAINS [J].
GILBERT, EJ .
ANNALS OF MATHEMATICAL STATISTICS, 1959, 30 (03) :688-697
[7]   IDENTIFIABILITY OF HIDDEN MARKOV INFORMATION-SOURCES AND THEIR MINIMUM DEGREES OF FREEDOM [J].
ITO, H ;
AMARI, SI ;
KOBAYASHI, K .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (02) :324-333
[8]   EQUIVALENCE OF AGGREGATED MARKOV-MODELS OF ION-CHANNEL GATING [J].
KIENKER, P .
PROCEEDINGS OF THE ROYAL SOCIETY SERIES B-BIOLOGICAL SCIENCES, 1989, 236 (1284) :269-309
[9]   A TUTORIAL ON HIDDEN MARKOV-MODELS AND SELECTED APPLICATIONS IN SPEECH RECOGNITION [J].
RABINER, LR .
PROCEEDINGS OF THE IEEE, 1989, 77 (02) :257-286
[10]  
RYDEN T, 1993, IDENTIFIABILITY ORDE