Skip to main content
SpringerLink
Log in
Book cover

Computational Social Network Analysis pp 241–266Cite as

Vmap-Layout, a Layout Algorithm for Drawing Scientograms

  • Chapter
  • First Online:

  • 2876 Accesses

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

We present in this chapter a drawing algorithm to represent graphically co-citation networks (scientograms). These networks have some interesting and unusual topological properties, which are often valuable to be visualized. In general, these networks are pruned with a network scaling algorithm and then visualized using a drawing algorithm (J Vis Lang Comput 9:267–286, 1998). However, typical drawing algorithms do not work properly, especially when the size of the networks grows. Edge crossings appear while the drawing space is not adequately filled, resulting in an unsightly display. The approach presented in this chapter is able to print the networks filling all the available space in an aesthetic way, while avoiding edge crossings. The algorithm is detailed and compared with the classical Kamada–Kawai drawing algorithm on several scientograms.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

Learn about institutional subscriptions

Notes

  1. 1.

    Currently registered as Thomson Scientific.

  2. 2.

    http://www.scimago.es/

  3. 3.

    The library we have used for this process is called the ANN Library [17]. The advantage of this library is that an approximate distance computation is used in order to speed up the process, provided the fact that knowing the exact values of the distances is not important, which is the case in our application.

References

  1. Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM. 45(6):891–923

    Article  MATH  MathSciNet  Google Scholar 

  2. Battista GD, Eades P, Tamassia R, Tollis I (1994) Algorithms for drawing graphs: An annoted bibliography. Comp Geo Theor Appl 4(5):235–282

    Article  MATH  Google Scholar 

  3. Battista GD, Eades P, Tamassia R, Tollis I (1999) Graph Drawing. Prentice Hall, Upper Saddle River, NJ

    MATH  Google Scholar 

  4. Bavelas A (1951) Réseaux de communications au sein de groupes placés dans des conditions expérimentales de travail, Les sciences de la politique aux États- Unis. Armand Colin, Paris

    Google Scholar 

  5. Brandes U, Erlebach T (2005) Network analysis: Methodological foundations, Vol. 3418 of Lecture Notes in Computer Science. Springer, Berlin

    Book  MATH  Google Scholar 

  6. Brandes U, Kenis P, Wagner D (2003) Communicating centrality in policy network drawings. IEEE Trans Vis Comput Gr 9(2):241–253

    Article  Google Scholar 

  7. Brandes U, Wagner D (2003) Graph drawing software, Visone – analysis and visualization of social networks. Berlin, pp 321–340

    Google Scholar 

  8. Chen C (1998) Bridging the gap: The use of pathfinder networks in visual navigation. J Vis Lang Comput 9:267–286

    Article  Google Scholar 

  9. Chen C (1998) Generalised similarity analysis and pathfinder network scaling. Interact Comput 10:107–128

    Article  Google Scholar 

  10. Chen C (2004) Information visualization: Beyond the horizon. Springer, Berlin, Germany

    Google Scholar 

  11. Dearholt D, Schvaneveldt R (1990) Properties of pathfinder networks. In: Pathfinder associative networks: Studies in knowledge organization. Ablex Publishing Corporation, Norwood, NJ, pp 1–30

    Google Scholar 

  12. Dynes SBC, Gloor PA, Laubacher R, Zhao Y, Dynes S (2004) Temporal visualization and analysis of social networks. In: North American Association for Computational Social and Organizational Science Conference (NAACSOS), Pittsburgh

    Google Scholar 

  13. Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Software Pract Exper 21(11):1129–1164

    Article  Google Scholar 

  14. Gansner ER, North SC (2000) An open graph visualization system and its applications to software engineering. Software Pract Exper 30(11):1203–1233

    Article  MATH  Google Scholar 

  15. Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Info Process Lett 31(1):7–15

    Article  MATH  MathSciNet  Google Scholar 

  16. Katz DM, Stafford DK (2008) Hustle and flow: A social network analysis of the american federal judiciary. In: Annual Meeting of the The Law and Society Association, Montreal, Canada

    Google Scholar 

  17. Mount DM, Arya S (2006) ANN: A library for approximate nearest neighbor searching, version 1.1.1, online software available on http://www.cs.umd.edu/~mount/ANN/, released the 4/8/2006

  18. Moya-Anegón F, Vargas-Quesada B, Chinchilla-Rodríguez Z, Corera-Álvarez E, González-Molina A, Muñoz-Fernández F, Herrero-Solana V (2006) Vis. y Anal. de la Estr. Sci. Esp.: ISI web of science 1990-2005 (in Spanish). El Profesional de la Información, 15(4):258–269

    Google Scholar 

  19. Moya-Anegón F, Vargas-Quesada B, Chinchilla-Rodríguez Z, Corera-Álvarez E, González-Molina A, Muñoz-Fernández F, Herrero-Solana V (2007) Visualizing the marrow of science. J Am Soc Info Sci Technol 58(14):2167–2179

    Article  Google Scholar 

  20. Moya-Anegón F, Vargas-Quesada B, Chinchilla-Rodríguez Z, Corera-Álvarez E, Herrero-Solana V, Muñoz-Fernández F (2005) Domain analysis and information retrieval through the construction of heliocentric maps based on ISI-JCR category cocitation. Info Process Manage 41:1520–1533

    Article  Google Scholar 

  21. Moya-Anegón F, Vargas-Quesada B, Herrero-Solana V, Chinchilla-Rodríguez Z, Corera-Álvarez E, Muñoz-Fernández F (2004) A new technique for building maps of large scientific domains based on the cocitation of classes and categories. Scientometrics 61(1):129–145

    Article  Google Scholar 

  22. Nguyen QV, Huang ML (2002) A space-optimized tree visualization. In: IEEE symposium on information visualization (InfoVis 2002), pp 85–92

    Google Scholar 

  23. Parlebas P (1972) Centralité et compacité d’un graphe. Math. et Sci. Hum. 39:5–26

    MathSciNet  Google Scholar 

  24. Quirin A, Cordón O, Guerrero-Bote VP, Vargas-Quesada B, Moya-Anegón F (2008) A quick MST-based algorithm to obtain pathfinder networks. J Am Soc Info Sci Technol 59(12):1912–1924

    Article  Google Scholar 

  25. Salton G, Bergmark D (1979) A citation study of computer science literature. IEEE Trans Prof Commun 22:146–158

    Article  Google Scholar 

  26. Small H, Garfield E (1985) The geography of science: Disciplinary and national mappings. J Info Sci 11:147–159

    Article  Google Scholar 

  27. Vargas-Quesada B, Moya-Anegón F (2007) Visualizing the structure of science. Springer, New York

    Google Scholar 

  28. Vargas-Quesada B, Moya-Anegón F, Chinchilla-Rodríguez Z, Corera-Álvarez E, González-Molina A, Muñoz-Fernández FJ, Herrero-Solana V (2008) Evolución de la estructura científica española: ISI web of science 1990-2005 (in Spanish). El Profesional de la Información 17(1):22–37

    Article  Google Scholar 

  29. Vargas-Quesada B, Moya-Anegón F, Chinchilla-Rodríguez Z, González-Molina A (2007) Showing the essential science structure of a scientific domain and its evolution. Info Vis (in press)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. European Centre for Soft Computing, Edf. Científico Tecnológico, Mieres, Spain

    Arnaud Quirin & Oscar Cordón

Authors
  1. Arnaud Quirin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oscar Cordón
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arnaud Quirin .

Editor information

Editors and Affiliations

  1. Scientific Network for Innovation &, Machine Intelligence Research Labs (MIR), Auburn, 98071-2259, U.S.A.

    Ajith Abraham

  2. Fac. Computers & Information, Cairo University, Ahmed Zewal Street 5, Giza, 12613, Egypt

    Aboul-Ella Hassanien

  3. Dept. Computer Science, Technical University Ostrava, Tr. 17. Listopadu 15, Ostrava, 708 33, Czech Republic

    Vaclav Sná¿el

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Quirin, A., Cordón, O. (2010). Vmap-Layout, a Layout Algorithm for Drawing Scientograms. In: Abraham, A., Hassanien, AE., Sná¿el, V. (eds) Computational Social Network Analysis. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-229-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-229-0_9

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-228-3

  • Online ISBN: 978-1-84882-229-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation