Skip to main content

Topographic Maps for Clustering and Data Visualization

  • Chapter
Computational Intelligence: A Compendium

Part of the book series: Studies in Computational Intelligence ((SCI,volume 115))

Topographic maps (also known as topology-preserving mappings) are projections of a data set which attempt to capture some underlying structure therein. These are essentially unsupervised mappings (though supervised versions do exist), and so the algorithms must be structured in some way so that the final projection reveals some underlying structure in the data.

A more recent development is the Generative Topographic Mapping (GTM) developed by [1] in the late 1990s. This was a very active research area for a few years but the field seems to have lost some of its vitality recently. Some of this is no doubt due to the fact that the GTM is much more complex than the SOM and so researchers more interested in viewing their data sets rather than innovating in the field of topographic mappings have tended to use the SOM rather than the GTM. Also, the emphasis of GTM publications tended to be on the fact that it was a ‘principled alternative’ to the SOM. If researchers feel bound to stick to principled approaches, their research processes are limited in ways that do not happen in more application-oriented research. Also the quasi-religious Bayesian approach does not appeal to all researchers.

The rest of this Chapter is structured as follows: in Sect. 3, we discuss the basic competitive learning paradigm and the extension which leads to the SOM. In Sect. 4, we review the GTM and illustrate its use. Finally we review some of our recent work in this area.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 389.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akella A, Seshan S, Karp R, Shenker S, Papadimitriou C (2002) Selfish behavior and stability of the internet: a game theoretic analysis of TCP. In: Proc. ACM Annual Conf. of Speical Interest Group on Data Communications (SIGCOMM’02), August, Pittsburg, PA. ACM Press, New York, NY: 117-130.

    Google Scholar 

  2. Axelrod R (1984) The Evolution of Cooperation. Basic Books, New York, NY.

    Google Scholar 

  3. Barabasi A-L, Freeh VW, Jeong H, Brockman JB (2000) Parasitic computing. Nature, 412: 894-897.

    Article  Google Scholar 

  4. Domany E, Kinzel W (1984) Equivalence of Cellular Automata to Ising Models and Directed Percolation. Phys. Rev. Lett. 53: 311

    Article  MathSciNet  Google Scholar 

  5. Dresher M(1961) The Mathematics of Games of Strategy: Theory and Applications. Prentice-Hall, Englewood Cliffs, NJ.

    Google Scholar 

  6. Feigenbaum J, Papadimitriou C, Shenker S (2001) Sharing the cost of multicast transmissions. J. Computer and System Sciences, 63: 21-41.

    Article  MATH  MathSciNet  Google Scholar 

  7. Feigenbaum J, Papadimitriou C, Sami R, Shenker S (2002) A bgp-based mecha-nism for lowest-cost routing. In: Proc. 21st ACM Symp. Principles of Distributed Computing (PODC’02), July, Monterey, CA, ACM Press, New York, NY: 173-182.

    Google Scholar 

  8. Feigenbaum J, Shenker S (2002) Distributed algorithmic mechanism design: recent results and future directions. In: Proc. 6th ACM Workshop Discrete Algorithms and Methods for Communication (Dial-M’02), 28 September, Atlanta, GA. ACM Press, New York, NY: 1-13.

    Google Scholar 

  9. Foster I, Kesselman C(eds) The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco, CA.

    Google Scholar 

  10. Hofbauer J, Sigmund K (2003) Evolutionary game dynamics. Bulletin American Mathematical Society, 40: 479-519.

    Article  MATH  MathSciNet  Google Scholar 

  11. Ishida Y (2005) A critical phenomenon in a self-repair network by mutual copying. In: Khosla R, Howlett RJ, Jain LC (eds.) Proc. 9th Knowledge-Based Intelligent Engineering Systems (KES 2005), Lecture Notes in Computer Science LNCS/LNAI 3682. Springer-Verlag, Berlin: 86-92.

    Google Scholar 

  12. Ishida Y (2006) A game theoretic analysis on incentive for cooperation in a self-repairing network. In: Elleithy K (ed.) Advances and Innovations in Systems, Computing Sciences and Software Engineering. Proc. Intl. Joint Conf. Com-puter, Information and Systems Sciences and Engineering (CIS2E 06), 4-14 December, Bridgeport, CT, Springer-Verlag, Berlin.

    Google Scholar 

  13. Ishida Y, Mori T (2005) Spatial strategies on a generalized spatial prisoner’s dilemma. J. Artificial Life and Robotics, 93: 139-143.

    Article  Google Scholar 

  14. Ishida Y, Mori T (2005) A network self-repair by spatial strategies in spa-tial prisoner’s dilemma. In: Khosla R, Howlett RJ, Jain LC (eds.) Proc. 9th Knowledge-Based Intelligent Engineering Systems (KES 2005), Lecture Notes in Computer Science (LNCS/LNAI 3682), Springer-Verlag, Berlin: 79-85.

    Google Scholar 

  15. Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. In: Meinel C, Tison S (eds.) Lecture Notes in Computer Science LNCS1563: 404-413.

    Google Scholar 

  16. Lakshman TV, Kodialam M (2003) Detecting network intrusions via sampling: a game theoretic approach. In: Proc. 22nd Annual Joint Conf. IEEE Computer and Communications Societies (INFOCOM’03), 30 March - 3 April, San Francisco, CA. IEEE Press, Piscataway, NJ: 1880-1889.

    Google Scholar 

  17. Mavronikolas M, Spirakis P (2001) The price of selfish routing. In: Proc. 33rd Symp. Theory of Computing (STOC’01), 6-8 July, Hersonissos, Greece. ACM Press, New York, NY: 510-519.

    Google Scholar 

  18. Maynard-Smith J (1982) Evolution and the Theory of Games. Cambridge University Press, Cambridge, UK.

    Google Scholar 

  19. Nash J (1950) The bargaining problem. Econometrica, 18: 155-162.

    Article  MathSciNet  Google Scholar 

  20. Nisan N, Ronen A (2001) Algorithmic mechanism design. Games and Economic Behavior, 35: 166-196.

    Article  MATH  MathSciNet  Google Scholar 

  21. Nowak MA, May RM (1992) Evolutionary games and spatial chaos. Nature, 359: 826-829.

    Article  Google Scholar 

  22. Oohashi M, Ishida Y (2007) A game theoretic approach to regulating mutual repairing in a self-repairing network. In: Sobh T, Elleithy K, Mahmood A, Karim M (eds.) Innovative Algorithms and Techniques in Automation, Industrial Electronics and Telecommunications. Springer-Verlag, Berlin: 281-286.

    Chapter  Google Scholar 

  23. Papadimitriou C (2001) Algorithms, games, and the internet. In: Proc. 33rd Symp. Theory of Computing (STOC’01), 6-8 July, Hersonissos, Greece. ACM Press, New York, NY: 749-753.

    Google Scholar 

  24. Parkes D (1977) Iterative combinatorial auctions: achieving economic and com-putational efficiency. PhD Thesis, Department of Computer and Information Science, University of Pensylvania, PA.

    Google Scholar 

  25. Roughgarden T, Tardos E (2002) How bad is selfish routing? J. ACM, 492: 236-259.

    Article  MathSciNet  Google Scholar 

  26. Shooman ML(1968) Probabilistic Reliability: An Engineering Approach McGraw-Hill, New York, NY.

    Google Scholar 

  27. Shoham Y, Wellman M (1997) Economic principles of multi-agent systems. Artificial Intelligence, 94: 1-6.

    Article  Google Scholar 

  28. Taylor PD, Jonker LB (1978) Evolutionarily stable strategies and game dynamics. Mathematical Bioscience, 40: 145-156.

    Article  MATH  MathSciNet  Google Scholar 

  29. Walsh W, Wellman M (1998) A market protocol for decentralized task alloca-tion. In: Proc. 3rd Intl. Conf. Multi-Agent Systems (ICMAS-98), July, France. IEEE Computer Society Press, Los Alamitos, CA: 325-332.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fyfe, C. (2008). Topographic Maps for Clustering and Data Visualization. In: Fulcher, J., Jain, L.C. (eds) Computational Intelligence: A Compendium. Studies in Computational Intelligence, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78293-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78293-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78292-6

  • Online ISBN: 978-3-540-78293-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics