IDEAS home Printed from https://ideas.repec.org/a/vrs/itmasc/v19y2016i1p39-44n9.html
   My bibliography  Save this article

Markov Chain Modelling for Short-Term NDVI Time Series Forecasting

Author

Listed:
  • Stepčenko Artūrs
  • Čižovs Jurijs

    (Riga Technical University, Latvia)

Abstract

In this paper, the NDVI time series forecasting model has been developed based on the use of discrete time, continuous state Markov chain of suitable order. The normalised difference vegetation index (NDVI) is an indicator that describes the amount of chlorophyll (the green mass) and shows the relative density and health of vegetation; therefore, it is an important variable for vegetation forecasting. A Markov chain is a stochastic process that consists of a state space. This stochastic process undergoes transitions from one state to another in the state space with some probabilities. A Markov chain forecast model is flexible in accommodating various forecast assumptions and structures. The present paper discusses the considerations and techniques in building a Markov chain forecast model at each step. Continuous state Markov chain model is analytically described. Finally, the application of the proposed Markov chain model is illustrated with reference to a set of NDVI time series data.

Suggested Citation

  • Stepčenko Artūrs & Čižovs Jurijs, 2016. "Markov Chain Modelling for Short-Term NDVI Time Series Forecasting," Information Technology and Management Science, Sciendo, vol. 19(1), pages 39-44, December.
    • Handle: RePEc:vrs:itmasc:v:19:y:2016:i:1:p:39-44:n:9
    DOI: 10.1515/itms-2016-0009
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/itms-2016-0009
    Download Restriction: no
    File URL: https://libkey.io/10.1515/itms-2016-0009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:vrs:itmasc:v:19:y:2016:i:1:p:39-44:n:9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.