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

Applying Markov Chains for NDVI Time Series Forecasting of Latvian Regions

Author

Listed:
  • Stepchenko Arthur
  • Chizhov Jurij

    (Riga Technical University)

Abstract

Time series of earth observation based estimates of vegetation inform about variations in vegetation at the scale of Latvia. A vegetation index is an indicator that describes the amount of chlorophyll (the green mass) and shows the relative density and health of vegetation. NDVI index is an important variable for vegetation forecasting and management of various problems, such as climate change monitoring, energy usage monitoring, managing the consumption of natural resources, agricultural productivity monitoring, drought monitoring and forest fire detection. In this paper, we make a one-step-ahead prediction of 7-daily time series of NDVI index using Markov chains. The choice of a Markov chain is due to the fact that a Markov chain is a sequence of random variables where each variable is located in some state. And a Markov chain contains probabilities of moving from one state to other.

Suggested Citation

  • Stepchenko Arthur & Chizhov Jurij, 2015. "Applying Markov Chains for NDVI Time Series Forecasting of Latvian Regions," Information Technology and Management Science, Sciendo, vol. 18(1), pages 57-61, December.
    • Handle: RePEc:vrs:itmasc:v:18:y:2015:i:1:p:57-61:n:9
    DOI: 10.1515/itms-2015-0009
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/itms-2015-0009
    Download Restriction: no
    File URL: https://libkey.io/10.1515/itms-2015-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
    ---><---

    References listed on IDEAS

    as
    1. Vladimir Soloviev & Vladimir Saptsin & Dmitry Chabanenko, 2011. "Markov Chains application to the financial-economic time series prediction," Papers 1111.5254, arXiv.org.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Olawale Awe O. & Adedayo Adepoju A., 2018. "Modified Recursive Bayesian Algorithm For Estimating Time-Varying Parameters In Dynamic Linear Models," Statistics in Transition New Series, Polish Statistical Association, vol. 19(2), pages 258-293, June.
    2. O. Olawale Awe & A. Adedayo Adepoju, 2018. "Modified Recursive Bayesian Algorithm For Estimating Time-Varying Parameters In Dynamic Linear Models," Statistics in Transition New Series, Polish Statistical Association, vol. 19(2), pages 239-258, June.
    3. Wu, Sheng-Jhih & Chu, Moody T., 2017. "Markov chains with memory, tensor formulation, and the dynamics of power iteration," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 226-239.
    4. Kerolly Kedma Felix do Nascimento & Fábio Sandro dos Santos & Jader Silva Jale & Silvio Fernando Alves Xavier Júnior & Tiago A. E. Ferreira, 2023. "Extracting Rules via Markov Chains for Cryptocurrencies Returns Forecasting," Computational Economics, Springer;Society for Computational Economics, vol. 61(3), pages 1095-1114, March.
    5. Alina-Petronela Haller & Ovidiu Gherasim & Mariana B?lan & Carmen Uzl?u, 2020. "Medium-term forecast of European economic sustainable growth using Markov chains," Zbornik radova Ekonomskog fakulteta u Rijeci/Proceedings of Rijeka Faculty of Economics, University of Rijeka, Faculty of Economics and Business, vol. 38(2), pages 585-618.

    More about this item

    Statistics

    Access and download statistics

    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:18:y:2015:i:1:p:57-61: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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.