Skip to main content
Log in

Topology-based analysis of self-organizing maps for time series prediction

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

A self-organizing map (SOM) is a competitive learning neural network architecture that uses a set of classificatory neurons, which self-organize spatially based on input patterns. The application of standard SOM, and its variants, to time series prediction has been studied in the literature under different conditions and techniques. In this paper, we have focused on the standard Self-Organizing Maps, and its application for time series forecasting. We provide extensive numerical analysis considering regular and complex topologies, and real time series. Concretely, we study the impact of the number of neurons, the effect of the best-matching unit over its neighborhood, the use of nonlinear learning rate functions, and the importance of a proportional training together with a sampled input space as uniformly as possible. We have found that probabilistic updating in neighborhoods may be used as a second learning rate parameter within the SOM. We have also found that small-world and scale-free topologies are able to improve the error of regular lattices, depending on their own set of parameters, the number of neurons, and the length of the training set. Finally, we have found coherence between results of real time series and analytic benchmarks for forecasting.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26

Similar content being viewed by others

Notes

  1. In the original Watts–Strogatz model, p stands for the rewiring probability of an existing edge, while p in Higham and Higham (2000), Newman et al. (2000) refers to the probability of adding a new shortcut.

  2. Except in the MGTS benchmark, although it reaches the best SP value when \(P_\text {u}=0.25\).

References

  • Abinader FM, de Queiroz ACS, Honda DW (2011) Self-organized hierarchical methods for time series forecasting. In: 23rd IEEE international conference on tools with artificial intelligence (ICTAI), pp 1057–1062

  • Alahakoon D, Halgamuge SK (2000) Dynamic self-organizing maps with controlled growth for knowledge discovery. IEEE Trans Neural Netw 11(3):601–614

    Article  Google Scholar 

  • Albert R, Barabási AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47–97

    Article  MathSciNet  MATH  Google Scholar 

  • Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512

    Article  MathSciNet  MATH  Google Scholar 

  • Barreto GA (2007) Time series prediction with the self-organizing map: a review. Perspect Neural Symb Integr Stud Comput Intell 77:135–158

    Article  Google Scholar 

  • Barreto GA, Araújo AFR (2004) Identification and control of dynamical systems using the self-organizing map. IEEE Trans Neural Netw 15(5):1244–1259

    Article  Google Scholar 

  • Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex networks: structure and dynamics. Phys Rep 424:175–308

    Article  MathSciNet  Google Scholar 

  • Burguillo JC (2013) Playing with complexity: from cellular evolutionary algorithms with coalitions to self-organizing maps. Comput Math Appl 66:201–212

    Article  MathSciNet  MATH  Google Scholar 

  • Burguillo JC (2014) Using Self-organizing maps with complex network topologies and coalitions for time series prediction. J Soft Comput 18(4):695–705

    Article  Google Scholar 

  • Erdos P, Renyi A (1959) On random graphs. Publ Math 6:290–297

    MathSciNet  MATH  Google Scholar 

  • Furao S, Ogurab T, Hasegawa O (2007) An enhanced self-organizing incremental neural network for online unsupervised learning. Neural Netw 20:893–903

    Article  MATH  Google Scholar 

  • Higham DJ, Higham NJ (2000) MATLAB Guide. Society for Industrial and Applied Mathematics, Philadelphia

    MATH  Google Scholar 

  • Jiang F, Berry H, Schoenauer M (2009) The impact of network topology on self-organizing maps. In: GEC’09, Shanghai, pp 247–254

  • Kohonen T (1982) Self-organized formation of topologically correct feature maps. Biol Cybern 43(1):59–69

    Article  MathSciNet  MATH  Google Scholar 

  • Kohonen T (2001) Self-organizing maps, 3rd edn. Springer, Berlin

    Book  MATH  Google Scholar 

  • Kohonen T (2013) Essentials of the self-organizing map. Neural Netw 37:52–65

    Article  Google Scholar 

  • Mackey MC, Glass J (1977) Oscillation and chaos in physiological control systems. Science 197:287–289

    Article  Google Scholar 

  • Newman MEJ, Moore C, Watts DJ (2000) Mean-field solution of the small-world network model. Phys Rev Lett 84:32013204

  • Ni H, Yin H (2009) A self-organising mixture autoregressive network for FX time series modelling and prediction. Neurocomputing 72:3529–3537

  • Ouyang Y, Yin H (2014) A neural gas mixture autoregressive network for modelling and forecasting FX time series. Neurocomputing 135:171–179

  • Palit AK, Popovic D (2005) Computational intelligence in time series forecasting: theory and engineering applications, 1st edn. Springer, New York

    MATH  Google Scholar 

  • Strategic Engineering Research Group (SERG), Massachusetts, USA (2011) MIT toolbox for Network Analysis. http://strategic.mit.edu/downloads.php?page=matlab_networks

  • Taylor A, Higham D (2008) CONTEST: a controllable test matrix toolbox for MATLAB. Department of Mathematics, University of Strathclyde, Glasgow, G1 1XH, Scotland. http://www.mathstat.strath.ac.uk/outreach/contest/toolbox.html

  • The Santa Fe Time Series Competition Data (1994) http://www-psych.stanford.edu/~andreas/Time-Series/SantaFe.html

  • Van Hulle MM (2001) Self-organizing maps: theory, design, and application. Kaibundo, Tokyo

    Google Scholar 

  • Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393:440–442

    Article  Google Scholar 

  • Weigend A, Gershefeld N (1993) Time series prediction: forecasting the future and understanding the past. Addison-Wesley, Boston

    Google Scholar 

  • Yang S, Luo S, Li J (2006) An extended model on self-organizing map. In: Proceedings of the 13 international conference on Neural Information Processing (ICONIP’06), pp 987–994

  • Yin H (2008) The self-organizing maps: background, theories, extensions and applications. In: Computational intelligence: a compendium

  • Yin H, Allinson NM (2001) Self-organizing mixture networks for probability density estimation. IEEE Trans Neural Netw 12(2):405–411

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the Spanish Government, and the European Regional Development Fund (ERDF), under project TACTICA.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan C. Burguillo.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This research has not involved humans or animals.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

García-Rois, J., Burguillo, J.C. Topology-based analysis of self-organizing maps for time series prediction. Soft Comput 21, 1601–1618 (2017). https://doi.org/10.1007/s00500-015-1872-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-015-1872-5

Keywords

Navigation