Skip to main content

Summary

Categorical data sequences occur in many real world applications. The major problem in using higher-order Markov chain model is that the number of parameters increases exponentially with respect to the order of the model. In this paper, we propose a higher-order Markov chain model for modeling categorical data sequences where the number of model parameters increases linearly with respect to the order of the model. We present efficient estimation methods based on linear programming for the model parameters. The model is then compared with other existing models with simulated sequences and DNA data sequences of mouse.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ching, W., Fung, E., Ng, M.: A Higher-order Markov Model for the Newsboy’s Problem Journal of Operational Research Society 54 (2003) 291–298

    MATH  Google Scholar 

  2. Ching, W., Fung, E., Ng, M.: Higher-order Markov Chain Models for Categorical Data Sequences, International Journal of Naval Research Logistics 51 (2004) 557–574

    MathSciNet  MATH  Google Scholar 

  3. Fang, S., Puthenpura, S.: Linear Optimization and Extensions, Prentice-Hall, New Jersey (1993)

    Google Scholar 

  4. Logan, J.: A Structural Model of the Higher-order Markov Process Incorporating Reversion Effects, J. Math. Sociol. 8 (1981) 75–89

    Article  MATH  Google Scholar 

  5. MacDonald, I., Zucchini, W.: Hidden Markov and Other Models for Discrete-valued Time Series, Chapman & Hall, London (1997)

    MATH  Google Scholar 

  6. Raftery, A.: A Model for High-order Markov Chains, J. R. Statist. Soc. B 47 (1985) 528–539

    MATH  MathSciNet  Google Scholar 

  7. Raftery, A., Tavare, S.: Estimation and Modelling Repeated Patterns in High Order Markov Chains with the Mixture Transition Distribution Model, Appl. Statist. 43 (1994) 179–199

    MATH  Google Scholar 

  8. Waterman, M.: Introduction to Computational Biology, Chapman & Hall, Cambridge (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ching, W., Ng, M.K., Zhang, S. (2005). On Computation with Higher-order Markov Chains. In: Zhang, W., Tong, W., Chen, Z., Glowinski, R. (eds) Current Trends in High Performance Computing and Its Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27912-1_2

Download citation

Publish with us

Policies and ethics