Skip to main content
SpringerLink
Log in
Book cover

Proceedings of 2013 Chinese Intelligent Automation Conference pp 305–315Cite as

An Improved Force-Directed Algorithm Based on Emergence for Visualizing Complex Network

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 256))

Abstract

Visualization of complex network is one of the most important and difficult issues in complexity science. Most current visualization algorithms are based on drawing aesthetically and it’s difficult for them to find the structure information of complex network. To solve this problem, the Fruchterman-Reingold (FR) algorithm based on the force-directed layout is studied in this paper, which is most suitable for the visualization of complex network. From the emergent characteristic of complex network, an improved adaptive FR algorithm is proposed to reduce dependence on parameters in the FR algorithm. In the improved algorithm, the impact of the clustering coefficient on the attraction–repulsion between vertices is considered, and the clustering coefficient is thought to be a determinative indicator for emergence. Then, with the attraction–repulsion the topological characteristic of complex network is visualized. Experiments show that the improved algorithm makes the observation of the structure of complex network much easier. In addition, the improved algorithm displays superior stability and adaptability during experiments.

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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   219.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

References

  1. He S (2010) Study on visualization methods of complex biological networks. Jiangnan University, Wuxi (in Chinese)

    Google Scholar 

  2. Eades P (1984) A heuristic for graph drawing. Congressus Nutnerantiunt 42:149–160

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Gajer P, Goodrich MT, Kobourov SG (2004) A multi-dimensional approach to force-directed layouts for large graphs. Comput Geom 29(1):3–18

    Article  MathSciNet  MATH  Google Scholar 

  5. Rodgers P, Mutton P (2003) Visualizing weighted edges in graphs. In: Proceedings of the 7th international conference on information visualization. doi:10.1109/IV.2003.1217988

  6. Fruchterman TMJ, Reingoid EM (1991) Graph drawing by force-directed placement. Softw Pract Experience 21(11):1129–1164

    Article  Google Scholar 

  7. Chan DS, Chua KS, Leckie C et al (2003) Visualization of power-law network topologies. In: Proceedings of the 11th IEEE international conference on networks. doi:10.1109/ICON.2003.1266169

  8. Wu Y, Tang H, Liu H T (2012) Web swarm intelligence and emergent computation. Science Press, Beijing (in Chinese)

    Google Scholar 

  9. Tang H, Wang HT, Huang D (2009) Preliminary research on emergent phenomenon in Internet. J Chongqing Univ Posts Telecommun (Nat Sci Ed) 21(5):632–637 (in Chinese)

    Google Scholar 

  10. Tang H, Huang D, Wu Y (2010) Overviews on internet emergent behavior research. Comput Sci 37(5):34–39 (in Chinese)

    Google Scholar 

  11. Wu Y, Yao Y, Wang L (2011) A novel emergence model of public opinion based on small-world network. J Key Eng Mater 474–476:2263–2268 (in Chinese)

    Article  Google Scholar 

  12. Wu Y, Zhou K, Li YG (2010) The evaluation metrics for swarm emergent behaviors. Control Theor Appl 27(8):1086–1092 (in Chinese)

    Google Scholar 

  13. Wu Y, Yang JJ, Chen YT (2011) Metrics system of swarm emergence and its efficiency. J Chongqing Univ Posts Telecommun (Nat Sci Ed) 23(6):733–740 (in Chinese)

    MathSciNet  Google Scholar 

  14. Sugiyama K, Tagawa S, Toda M (1981) Methods for visual understanding of hierarchical system structures. IEEE Trans Syst Man Cybern 11(2):109–125

    Article  MathSciNet  Google Scholar 

  15. Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452–473

    Google Scholar 

  16. Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821–7826

    Article  MathSciNet  MATH  Google Scholar 

  17. Lusseau D, Schneider K, Boisseau OJ et al (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54:396–405

    Google Scholar 

  18. Zhu ZL, Lin S, Cui K et al (2011) Network topology layout algorithm based on community detection of complex networks. J Comput Aided Des Comput Graph 23(11):1808–1815 (in Chinese)

    Google Scholar 

Download references

Acknowledgments

Research of this paper is supported by the National Natural Science Foundation of China (No. 60873079, No. 61040044) and Natural Science Foundation of Chongqing of China (cstc2012jjA40027).

Author information

Authors and Affiliations

  1. Institute of Web Intelligence, Chongqing University of Posts and Telecommunications, No. 2 Chongwen Road, Nanan, Chongqing, People’s Republic of China

    Hongbo Li, Wenjing Geng, Yu Wu & Xian Wang

Authors
  1. Hongbo Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenjing Geng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xian Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu Wu .

Editor information

Editors and Affiliations

  1. , Department of Computer Science, Tsinghua University, Qinghua, Beijing, 100084, China, People's Republic

    Zengqi Sun

  2. Tsinghua University, Qinghua, Beijing, 100084, China, People's Republic

    Zhidong Deng

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, H., Geng, W., Wu, Y., Wang, X. (2013). An Improved Force-Directed Algorithm Based on Emergence for Visualizing Complex Network. In: Sun, Z., Deng, Z. (eds) Proceedings of 2013 Chinese Intelligent Automation Conference. Lecture Notes in Electrical Engineering, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38466-0_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38466-0_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38465-3

  • Online ISBN: 978-3-642-38466-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation