Probability distance based comp ression of hidden Markov models

Multiscale Modeling and Simulation

Volumn 8, Issue 5, 2010, Pages 1838-1861

  Wu, Hao ^a   Noé, Frank ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Compression; Fuzzy partition; Hidden Markov model; Total variation distance

Indexed keywords

COMPRESSION; COMPUTATIONAL BIOLOGY; DISCRETE SPACES; DYNAMICAL PROPERTIES; FUZZY PARTITION; GENERAL MODEL; MARKOV CHAIN; MODEL APPLICATION; MODEL REDUCTION TECHNIQUES; PROBABILITY DISTANCE; SPECIAL CLASS; TOTAL VARIATION; TRAFFIC NETWORKS;

BIOINFORMATICS; OBJECT RECOGNITION; STOCHASTIC MODELS;

HIDDEN MARKOV MODELS;

EID: 79251511230     PISSN: 15403459     EISSN: 15403467     Source Type: Journal    
DOI: 10.1137/090774161     Document Type: Article

References (47)

1. R. W. ALDHAHERI AND H. K. KHALIL, Aggregation and optimal control of nearly completely decomposable Markov chains, in Proceedings of the 28th IEEE Conference on Decision and Control, Tampa, FL, 1989, pp. 1277-1282.
2. R. W. ALDHAHERI AND H. K. KHALIL, Aggregation of the policy iteration method for nearly completely decomposable Markov chains, IEEE Trans. Automat. Control, 36 (1991), pp. 178-187.
3. O. BECKER AND M. KARPLUS, The topology of multidimensional potential energy surfaces: Theory and application to peptide structure and kinetics, J. Chem. Phys., 106 (1997), pp. 1495-1517.
4. J. C. BEZDEK, R. EHRLICH, AND W. FULL, FCM: The fuzzy c-means clustering algorithm, Computers & Geosci., 10 (1984), pp. 191-203.
5. V. J. BLUE, M. J. EMBRECHTS, AND J. L. ADLER, Cellular automata modeling of pedestrian movements, in Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics, Vol. 3, 1997, pp. 2320-2323.
6. P. CALAMAI AND J. MORÉ, Projected gradient methods for linearly constrained problems, Math. Programming, 39 (1987), pp. 93-116.
7. G. CASELLA AND R. L. BERGER, Statistical Inference, Duxbury, Pacific Grove, CA, 2002.
8. T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST, AND C. STEIN, Introduction to Algorithms, MIT Press, Cambridge, MA, McGraw-Hill, Boston, 2001.
9. T. DAYAR AND W. J. STEWART, Quasi lumpability, lower-bounding coupling matrices, and nearly completely decomposable Markov chains, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 482-498.
10. P. DEUFLHARD AND M. WEBER, Robust Perron cluster analysis in conformation dynamics, Linear Algebra Appl., 398 (2005), pp. 161-184.
11. S. DEY AND I. MAREELS, Reduced-complexity estimation for large-scale hidden Markov models, IEEE Trans. Signal Process., 52 (2004), pp. 1242-1249.
12. S. EDDY, Hidden Markov models, Curr. Opin. Struct. Biol., 6 (1996), pp. 361-365.
13. L. FINESSO, A. GRASSI, AND P. SPREIJ, Approximation of stationary processes by hidden Markov models, Math. Control Signals Systems, 22 (2010), pp. 1-22.
14. I. GERONTIDIS AND S. KONTAKOS, Markov chain lumpability on fuzzy partitions, in Proceedings of the IEEE International Fuzzy Systems Conference, 2007, pp. 1-6.
15. A. L. GIBBS AND F. E. SU, On choosing and bounding probability metrics, Internat. Statist. Rev., 70 (2002), pp. 419-435.
16. I. HORENKO, S. DOLAPTCHIEV, A. ELISEEV, I. MOKHOV, AND R. KLEIN, Metastable decomposition of high-dimensional meteorological data with gaps, J. Atm. Sci., 65 (2008), pp. 3479-3496.
17. H. JAEGER, Observable operator processes and conditioned continuation representations, Neural Comput., 12 (2000), pp. 1371-1398.
18. J. G. KEMENY AND J. L. SNELL, Finite Markov Chains, Springer, New York, Heidelberg, 1976.
19. G. KOTSALIS, Model Reduction for Hidden Markov Models, Ph. D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 2007.
20. G. KOTSALIS, A. MEGRETSKI, AND M. A. DAHLEH, A model reduction algorithm for hidden Markov models, in Proceedings of the 45th IEEE Conference on Decision and Control, 2006, pp. 3424-3429. (Pubitemid 351284259)
21. V. KRISHNAMURTHY, Adaptive estimation of hidden nearly completely decomposable Markov chains, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, 1994, pp. 337-340.
22. V. KRISHNAMURTHY, Adaptive estimation of hidden nearly completely decomposable Markov chains with applications in blind equalization, Internat. J. Adapt. Control Signal Process., 8 (1994), pp. 237-260.
23. P. LARRAÑAGA, R. ETXEBERRIA, J. LOZANO, AND J. PEÑA, Optimization by Learning and Simulation of Bayesian and Gaussian Networks, Technical report EHU-KZAAIK-4/99, University of the Basque Country, Basque Country, Spain, 1999.
24. M. MÖHLE, General applied probability-Total variation distances and rates of convergence for ancestral coalescent processes in exchangeable population models, Adv. in Appl. Probab., 32 (2000), pp. 983-993.
25. J. NIEDBALSKI, Full and Reduced Order Estimation of Traffic Dynamics Using Markov Chains, Master's thesis, University of Illinois at Urbana-Champaign, Urbana, IL, 2007.
26. J. NIEDBALSKI, K. DENG, P. MEHTA, AND S. MEYN, Model reduction for reduced order estimation in traffic models, in Proceedings of the American Control Conference, IEEE, New York, 2008, pp. 914-919.
27. F. NOÉ AND S. FISCHER, Transition networks for modeling the kinetics of conformational change in macromolecules, Curr. Opin. Struct. Biol., 18 (2008), pp. 154-162.
28. F. NOÉ, C. SCHÜTTE, E. VANDEN-EIJNDEN, L. REICH, AND T. R. WEIKL, Constructing the equilibrium ensemble of folding pathways from short off-equilibrium simulations, Proc. Natl. Acad. Sci. USA, 106 (2009), pp. 19011-19016.
29. J. R. NORRIS, Markov Chains, Cambridge University Press, Cambridge, UK, 1998.
30. S. OZKAN, K. DILL, AND I. BAHAR, Computing the transition state populations in simple protein models, Biopolymers, 68 (2003), pp. 35-46.
31. B. PENG, Convergence, Rank Reduction and Bounds for the Stationary Analysis of Markov Chains, Ph. D. thesis, North Carolina State University, Raleigh, NC, 2004.
32. J. PENG AND Z. LIN, A non-interior continuation method for generalized linear complementarity problems, Math. Program., 86 (1999), pp. 533-563.
33. L. PUTZIG, D. BECHERER, AND I. HORENKO, Optimal allocation of a futures portfolio utilizing numerical market phase-detection, SIAM J. Financial Math., 1 (2010), pp. 752-779.
34. L. RABINER, A tutorial on hidden Markov models and selected applications in speech recognition, Proc. IEEE, 77 (1989), pp. 257-286.
35. L. RABINER AND B. JUANG, An introduction to hidden Markov models, IEEE ASSP Magazine, 3 (1986), pp. 4-16.
36. W. RUNGSARITYOTIN, R. KRAUSE, A. SCHÖDL, AND A. SCHLIEP, Identifying protein complexes directly from high-throughput TAP data with Markov random fields, BMC Bioinformatics, 8 (2007), p. 482.
37. A. SCHLIEP, A. SCHÖNHUTH, AND C. STEINHOFF, Using hidden Markov models to analyze gene expression time course data, Bioinformatics, 19 (2003), pp. i255-i263.
38. C. SCHÜTTE, A. FISCHER, W. HUISINGA, AND P. DEUFLHARD, A direct approach to conformational dynamics based on hybrid Monte Carlo, J. Comput. Phys., 151 (1999), pp. 146-168.
39. L. SHUE AND S. DEY, Complexity reduction in fixed-lag smoothing for hidden Markov models, IEEE Trans. Signal Process., 50 (2002), pp. 1124-1132.
40. W. M. SPEARS, The Role of Mutation and Recombination in Evolutionary Algorithms, Ph. D. thesis, George Mason University, Fairfax, VA, 1998.
41. W. M. SPEARS, A compression algorithm for probability transition matrices, SIAM J. Matrix Anal. Appl., 20 (1998), pp. 60-77.
42. W. SUN AND Y. YUAN, Optimization Theory and Methods. Nonlinear Programming, Springer, New York, 2006.
43. D. J. WALES, Energy Landscapes, Cambridge University Press, Cambridge, UK, 2003.
44. M. WEBER, Improved Perron Cluster Analysis, Technical report ZIB-Report 03-04, Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Berlin, Germany, 2003.
45. L. B. WHITE, R. MAHONY, AND G. D. BRUSHE, Lumpable hidden Markov models-Model reduction and reduced complexity filtering, IEEE Trans. Automat. Control, 45 (2000), pp. 2297-2306.
46. L. ZADEH, Probability measures of fuzzy events, J. Math. Anal. Appl., 23 (1968), pp. 421-427.
47. J. ZHU, Mining Web Site Link Structures for Adaptive Web Site Navigation and Search, Ph. D. thesis, University of Ulster, Jordanstown, UK, 2003.