Skip to main content

Time series forecasting by finite-state automata

  • Contributed Papers
  • Conference paper
  • First Online:
  • 2443 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1260))

Abstract

We have developed automata to address the problem of time series forecasting. After turning the time series into sequences of letters, Mohri's algorithm constructs an automaton indexing this text that, once a given word is read, can be used to obtain the set of its positions. By using the automaton to determine what letter usually follows the last sequence of length L, we have developed a one step predictor. This predictor will be used to analyze sunspot activity data.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.E.P. Box and G.M. Jenkins. Time series analysis, Forecasting and Control, Holden-Day, San Francisco, 1970.

    Google Scholar 

  2. J.T. Connor, R.D. Martin and L.E. Atlas. Recurrent Neural Networks and Robust Time Series Prediction, IEEE Transactions on Neural Networks, 5(2):240–254

    Google Scholar 

  3. M. Crochemore. Transducers and Repetitions, Theorical Computer Science 45, 1986.

    Google Scholar 

  4. M. Crochemore and W. Rytter. Text Algorithms, Oxford University Press, 1994.

    Google Scholar 

  5. A. Kouam, F. Badran F., S. Thiria. Approche Méthodologique pour l'Etude de la Prévision à l'aide des Réseaux de Neurones, Cinquièmes Journées Internationales, 2–6 Novembre 1992, Nîmes, France.

    Google Scholar 

  6. M. Mohri. Application of Local Grammars Automata: an efficient Algorithm, Technical repport IGM 94-16, University of Marne-la-Vallée, France, 1994.

    Google Scholar 

  7. M.B. Priestley. Non-linear and Non-stationary Time Series Analysis, Academic Press, 1988.

    Google Scholar 

  8. Weigend A. S., Gershenfeld N.A. (eds.). Time series Prediction, Forecasting the Future and Understanding the Past, Proceedings of the NATO Advanced Research Workshop on Comparative Time Series Analysis, Santa Fe, New Mexico, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Darrell Raymond Derick Wood Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boné, R., Daguin, C., Georgevail, A., Maurel, D. (1997). Time series forecasting by finite-state automata. In: Raymond, D., Wood, D., Yu, S. (eds) Automata Implementation. WIA 1996. Lecture Notes in Computer Science, vol 1260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63174-7_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-63174-7_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63174-3

  • Online ISBN: 978-3-540-69205-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics