Skip to main content
Log in

Automated and weighted self-organizing time maps

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

This paper proposes schemes for automated and weighted self-organizing time maps (SOTMs). The SOTM provides means for a visual approach to evolutionary clustering, which aims at producing a sequence of clustering solutions. This task we denote as visual dynamic clustering. The implication of an automated SOTM is not only a data-driven parametrization of the SOTM, but also the feature of adjusting the training to the characteristics of the data at each time step. The aim of the weighted SOTM is to improve learning from more trustworthy or important data with an instance-varying weight. The schemes for automated and weighted SOTMs are illustrated on two real-world datasets: (i) country-level risk indicators to measure the evolution of global imbalances and (ii) credit applicant data to measure the evolution of firm-level credit risks.

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

Similar content being viewed by others

References

  1. Berg A, Borensztein E, Pattillo C (2005) Assessing early warning systems: How have they worked in practice? IMF Staff Pap 52(3):462–502

    Google Scholar 

  2. Chakrabarti D, Kumar R, Tomkins A (2006) Evolutionary clustering. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 06). ACM, Philadelphia, pp 554–560

  3. Chakraborty S, Nagwani N (2011) Analysis and study of incremental k-means clustering algorithm. In: Mantri A, Saraswati Kendra S, Kumar G, Kumar S (eds) High performance architecture and grid computing. Communications in computer and information science, vol 169. Springer, Berlin, pp 338–341

    Google Scholar 

  4. Holmbom A, Sarlin P, Yao Z, Eklund T, Back B (2013) Visual data-driven profiling of green consumers. In: Proceedings of the international conference on information visualization. IEEE, pp 291–298

  5. Kangas J (1995) Sample weighting when training self-organizing maps for image compression. In: Proceedings of the 1995 IEEE workshop on neural networks for signal processing, pp 343–350

  6. Kaski S, Lagus K (1996) Comparing self-organizing maps. In: Proceedings of the international conference on artificial neural networks (ICANN ’96). Springer, Bochum, Germany, pp 809–814

  7. Kim K, Ra J (1993) Edge preserving vector quantization using self-organizing map based on adaptive learning. In: Proceedings of the international joint conference on neural networks. IEEE Press, pp 1219–1222

  8. Kiviluoto K (1996) Topology preservation in self-organizing maps. In: Proceedings of the IEEE international conference on artificial neural networks. Piscataway, New Jersey, USA, pp 294–299

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

    Article  Google Scholar 

  10. Kohonen T (1993) Things you haven’t heard about the self-organizing map. In: Proceedings of the international conference on neural networks. pp 1147–1156

  11. Lampinen J, Oja E (1992) Clustering properties of hierarchical self-organizing maps. J Math Imaging Vis 2(2–3):261–272

    Article  Google Scholar 

  12. Langone R, Alzate C, Suykens JAK (2013) Kernel spectral clustering with memory effect. Phys A 392(10):2588–2606

    Article  Google Scholar 

  13. Sammon J (1969) A non-linear mapping for data structure analysis. IEEE Trans Comput 18(5):401–409

    Article  Google Scholar 

  14. Sarlin P (2013a) Decomposing the global financial crisis: a self-organizing time map. Pattern Recogn Lett 34:1701–1709

    Article  Google Scholar 

  15. Sarlin P (2013b) Replacing the time dimension: a self-organizing time map over any variable. In: Proceedings of the 4th workshop on new challenges in neural computation (NC2). Machine Learning Reports, Saarbrucken, Germany, pp 17–24

  16. Sarlin P (2013c) Self-organizing time map: an abstraction of temporal multivariate patterns. Neurocomputing 99(1):496–508

    Article  Google Scholar 

  17. Sarlin P (2013d) A weighted SOM for classifying data with instance-varying importance. Int J Mach Learn Cybern. doi:10.1007/s13042-013-0175-3

  18. Sarlin P, Yao Z (2013) Clustering of the self-organizing time map. Neurocomputing 121:317–327

    Article  Google Scholar 

  19. Vesanto J, Himberg J, Alhoniemi E, Parhankangas J (1999) Self-Organizing Map in matlab: the SOM toolbox. In: Proceedings of the matlab DSP conference. pp 35–40

  20. Yao Z, Sarlin P, Eklund T, Back B (2012) Temporal customer segmentation using the self-organizing time map. In: Proceedings of the international conference on information visualisation (iV 12). IEEE Press, Montpellier, France, pp 234–240

  21. Yao Z, Sarlin P, Eklund T, Back B (2013) Visualizing dynamics in customer behavior with the self-organizing time map. Technical report, TUCS Technical Report 1085

  22. Yin H (2008) The self-organizing maps: background, theories, extensions and applications. In: Fulcher J, Jain L (eds) Computational intelligence: a compendium. Springer, Heidelberg, Germany, pp 715–762

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Sarlin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sarlin, P. Automated and weighted self-organizing time maps. Knowl Inf Syst 44, 493–505 (2015). https://doi.org/10.1007/s10115-014-0762-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-014-0762-y

Keywords

Navigation