Skip to main content
SpringerLink
Log in

VSAN: A new visualization method for super-large-scale academic networks

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

As a carrier of knowledge, papers have been a popular choice since ancient times for documenting everything from major historical events to breakthroughs in science and technology. With the booming development of science and technology, the number of papers has been growing exponentially. Just like the fact that Internet of Things (IoT) allows the world to be connected in a flatter way, how will the network formed by massive academic papers look like? Most existing visualization methods can only handle up to hundreds of thousands of node size, which is much smaller than that of academic networks which are usually composed of millions or even more nodes. In this paper, we are thus motivated to break this scale limit and design a new visualization method particularly for super-large-scale academic networks (VSAN). Nodes can represent papers or authors while the edges means the relation (e.g., citation, coauthorship) between them. In order to comprehensively improve the visualization effect, three levels of optimization are taken into account in the whole design of VSAN in a progressive manner, i.e., bearing scale, loading speed, and effect of layout details. Our main contributions are two folded: 1) We design an equivalent segmentation layout method that goes beyond the limit encountered by state-of-the-arts, thus ensuring the possibility of visually revealing the correlations of larger-scale academic entities. 2) We further propose a hierarchical slice loading approach that enables users to observe the visualized graphs of the academic network at both macroscopic and microscopic levels, with the ability to quickly zoom between different levels. In addition, we propose a “jumping between nebula graphs” method that connects the static pages of many academic graphs and helps users to form a more systematic and comprehensive understanding of various academic networks. Applying our methods to three academic paper citation datasets in the AceMap database confirms the visualization scalability of VSAN in the sense that it can visualize academic networks with more than 4 million nodes. The super-large-scale visualization not only allows a galaxy-like scholarly picture unfolding that were never discovered previously, but also returns some interesting observations that may drive extra attention from scientists.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Weis J W, Jacobson J M. Learning on knowledge graph dynamics provides an early warning of impactful research. Nature Biotechnology, 2021, 39(10): 1300–1307

    Article  Google Scholar 

  2. Ebesu T, Fang Y. Neural citation network for context-aware citation recommendation. In: Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2017, 1093–1096

  3. Guns R, Rousseau R. Recommending research collaborations using link prediction and random forest classifiers. Scientometrics, 2014, 101(2): 1461–1473

    Article  Google Scholar 

  4. Wang W, Yu S, Bekele T M, Kong X, Xia F. Scientific collaboration patterns vary with scholars’ academic ages. Scientometrics, 2017, 112(1): 329–343

    Article  Google Scholar 

  5. Amjad T, Ding Y, Xu J, Zhang C, Daud A, Tang J, Song M. Standing on the shoulders of giants. Journal of Informetrics, 2017, 11(1): 307–323

    Article  Google Scholar 

  6. Jacomy M, Venturini T, Heymann S, Bastian M. ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLoS One, 2014, 9(6): e98679

    Article  Google Scholar 

  7. Fruchterman T M J, Reingold E M. Graph drawing by force-directed placement. Software: Practice and Experience, 1991, 21(11): 1129–1164

    Google Scholar 

  8. Hu Y. Efficient, high-quality force-directed graph drawing. The Mathematica Journal, 2005, 10(1): 37–71

    Google Scholar 

  9. Tang J, Liu J, Zhang M, Mei Q. Visualizing large-scale and high-dimensional data. In: Proceedings of the 25th International Conference on World Wide Web. 2016, 287–297

  10. Saket B, Endert A, Stasko J. Beyond usability and performance: a review of user experience-focused evaluations in visualization. In: Proceedings of the 6th Workshop on Beyond Time and Errors on Novel Evaluation Methods for Visualization. 2016, 133–142

  11. Liu Z, Heer J. The effects of interactive latency on exploratory visual analysis. IEEE Transactions on Visualization and Computer Graphics, 2014, 20(12): 2122–2131

    Article  Google Scholar 

  12. Park Y, Cafarella M, Mozafari B. Visualization-aware sampling for very large databases. In: Proceedings of the 32nd IEEE International Conference on Data Engineering (ICDE). 2016, 755–766

  13. Tan Z, Liu C, Mao Y, Guo Y, Shen J, Wang X. AceMap: a novel approach towards displaying relationship among academic literatures. In: Proceedings of the 25th International Conference Companion on World Wide Web. 2016, 437–442

  14. Von Landesberger T, Kuijper A, Schreck T, Kohlhammer J, van Wijk J J, Fekete J D, Fellner D W. Visual analysis of large graphs: state-of-the-art and future research challenges. Computer Graphics Forum, 2011, 30(6): 1719–1749

    Article  Google Scholar 

  15. Hu Y, Shi L. Visualizing large graphs. WIREs Computational Statistics, 2015, 7(2): 115–136

    Article  MathSciNet  Google Scholar 

  16. Jia Y, Hoberock J, Garland M, Hart J. On the visualization of social and other scale-free networks. IEEE Transactions on Visualization and Computer Graphics, 2008, 14(6): 1285–1292

    Article  Google Scholar 

  17. Gansner E R, Hu Y, North S, Scheidegger C. Multilevel agglomerative edge bundling for visualizing large graphs. In: Proceedings of 2011 IEEE Pacific Visualization Symposium. 2011, 187–194

  18. Batagelj V, Brandenburg F J, Didimo W, Liotta G, Palladino P, Patrignani M. Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. IEEE Transactions on Visualization and Computer Graphics, 2011, 17(11): 1587–1598

    Article  Google Scholar 

  19. Bikakis N, Papastefanatos G, Skourla M, Sellis T. A hierarchical aggregation framework for efficient multilevel visual exploration and analysis. Semantic Web, 2017, 8(1): 139–179

    Article  Google Scholar 

  20. Cheng D, Schretlen P, Kronenfeld N, Bozowsky N, Wright W. Tile based visual analytics for twitter big data exploratory analysis. In: Proceedings of 2013 IEEE International Conference on Big Data. 2013, 2–4

  21. Liu Z, Jiang B, Heer J. imMens: real-time visual querying of big data. Computer Graphics Forum, 2013, 32(3pt4): 421–430

    Article  Google Scholar 

  22. Mackinlay J D, Rao R, Card S K. An organic user interface for searching citation links. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. 1995, 67–73

  23. Elmqvist N, Tsigas P. CiteWiz: a tool for the visualization of scientific citation networks. Information Visualization, 2007, 6(3): 215–232

    Article  Google Scholar 

  24. Shi L, Tong H, Tang J, Lin C. VEGAS: visual influEnce GrAph summarization on citation networks. IEEE Transactions on Knowledge and Data Engineering, 2015, 27(12): 3417–3431

    Article  Google Scholar 

  25. Jing M, Li X, Hu Y. Interactive temporal visualization of collaboration networks. In: Proceedings of the 18th Pacific-Rim Conference on Multimedia on Advances in Multimedia Information Processing–PCM 2017. 2017, 713–722

  26. Nakazawa R, Itoh T, Saito T. Analytics and visualization of citation network applying topic-based clustering. Journal of Visualization, 2018, 21(4): 681–693

    Article  Google Scholar 

  27. Wang Y, Shi C, Li L, Tong H, Qu H. Visualizing research impact through citation data. ACM Transactions on Interactive Intelligent Systems, 2018, 8(1): 5

    Article  Google Scholar 

  28. Guo Z, Tao J, Chen S, Chawla N, Wang C. SD2: slicing and dicing scholarly data for interactive evaluation of academic performance. IEEE Transactions on Visualization and Computer Graphics, 2022

  29. Chen C. Searching for intellectual turning points: progressive knowledge domain visualization. Proceedings of the National Academy of Sciences of the United States of America, 2004, 101(S1): 5303–5310

    Article  Google Scholar 

  30. Van Eck N J, Waltman L. CitNetExplorer: a new software tool for analyzing and visualizing citation networks. Journal of Informetrics, 2014, 8(4): 802–823

    Article  Google Scholar 

  31. Lin Z, Cao N, Tong H, Wang F, Kang U, Chau D H P. Demonstrating interactive multi-resolution large graph exploration. In: Proceedings of the 13th IEEE International Conference on Data Mining Workshops. 2013, 1097–1100

  32. Ren D, Lee B, Höllerer T. Stardust: accessible and transparent GPU support for information visualization rendering. Computer Graphics Forum, 2017, 36(3): 179–188

    Article  Google Scholar 

  33. Tao W, Liu X, Wang Y, Battle L, Demiralp Ç, Chang R, Stonebraker M. Kyrix: interactive pan/zoom visualizations at scale. Computer Graphics Forum, 2019, 38(3): 529–540

    Article  Google Scholar 

  34. Wang Y, Bai Z, Lin Z, Dong X, Feng Y, Pan J, Chen W. G6: a web-based library for graph visualization. Visual Informatics, 2021, 5(4): 49–55

    Article  Google Scholar 

  35. Han D, Pan J, Zhao X, Chen W. NetV.js: a web-based library for high-efficiency visualization of large-scale graphs and networks. Visual Informatics, 2021, 5(1): 61–66

    Article  Google Scholar 

  36. Blondel V D, Guillaume J L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008, 2008: P10008

    Article  MATH  Google Scholar 

  37. Bastian M, Heymann S, Jacomy M. Gephi: an open source software for exploring and manipulating networks. In: Proceedings of the International AAAI Conference on Web and Social Media. 2009, 361–362

  38. Leskovec J, Lang K J, Dasgupta A, Mahoney M W. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 2009, 6(1): 29–123

    Article  MathSciNet  MATH  Google Scholar 

  39. Rozemberczki B, Sarkar R. Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management. 2020, 1325–1334

  40. Rozemberczki B, Allen C, Sarkar R. Multi-scale attributed node embedding. Journal of Complex Networks, 2021, 9(2): cnab014

    Article  MathSciNet  MATH  Google Scholar 

  41. Yang J, Leskovec J. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems, 2015, 42(1): 181–213

    Article  Google Scholar 

  42. Kruiger J F, Rauber P E, Martins R M, Kerren A, Kobourov S, Telea A C. Graph layouts by t-SNE. Computer Graphics Forum, 2017, 36(3): 283–294

    Article  Google Scholar 

  43. Hachul S, Jünger M. Drawing large graphs with a potential-field-based multilevel algorithm. In: Proceedings of the 12th International Symposium on Graph Drawing. 2004, 285–295

  44. Brandes U, Pich C. Eigensolver methods for progressive multidimensional scaling of large data. In: Proceedings of the 14th International Symposium on Graph Drawing. 2006, 42–53

  45. Gajer P, Kobourov S G. GRIP: graph drawing with intelligent placement. In: Proceedings of the 8th International Symposium on Graph Drawing. 2000, 222–228

  46. Kamada T, Kawai S. An algorithm for drawing general undirected graphs. Information Processing Letters, 1989, 31(1): 7–15

    Article  MathSciNet  MATH  Google Scholar 

  47. Laemmli U K. Cleavage of structural proteins during the assembly of the head of bacteriophage T4. Nature, 1970, 227(5259): 680–685

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant Nos. 42050105, 62020106005, 62061146002, 61960206002), the Shanghai Pilot Program for Basic Research - Shanghai Jiao Tong University, the 100-Talents Program of Xinhua News Agency, and the Program of Shanghai Academic/Technology Research Leader (No. 18XD1401800).

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China

    Qi Li & Xinbing Wang

  2. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China

    Xingli Wang & Luoyi Fu

  3. School of Environmental Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China

    Xinde Cao

  4. School of Oceanography, Shanghai Jiao Tong University, Shanghai, 200240, China

    Jing Zhang

  5. Institute of Geographic Sciences and Natural Resources Research, Chinese Academy of Sciences, Beijing, 100101, China

    Chenghu Zhou

Authors
  1. Qi Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xingli Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luoyi Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xinde Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xinbing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jing Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Chenghu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xinbing Wang.

Additional information

Qi Li received his BE degree in Information and Communication Engineering from Xidian University, China in 2019. He is currently pursuing his PhD degree in Department of Electronic Engineering in Shanghai Jiao Tong University, China. His research interests are big data and machine learning.

Xingli Wang received his BE degree in computer science and technology from Shanghai Jiao Tong University, China in 2022. Currently, he is pursuing his MS degree in the Department of Computer Science and Engineering, Shanghai Jiao Tong University, China. His current research interest is data mining.

Luoyi Fu received the BE degree in Electronic Engineering from Shanghai Jiao Tong University, China in 2009 and the PhD degree in computer science and engineering in the same university, in 2015. She is currently working as an assistant professor in the Department of Computer Science and Engineering, Shanghai Jiao Tong University, China. Her research of interests are in the area of scaling laws analysis in wireless networks, connectivity analysis, sensor networks and social networks.

Xinde Cao received the MS degree in Analytical Chemistry from University of Science and Technology of China, China in 1995 and the PhD degree in Analytical Chemistry in the same university in 1998. Currently, he is a professor in the School of Environmental Science and Engineering, Shanghai Jiao Tong University, China.

Xinbing Wang received the BS degree from the Department of Automation, Shanghai Jiao Tong University, China in 1998, the MS degree from the Department of Computer Science and Technology, Tsinghua University, China in 2001, and the PhD degree, major from the Department of Electrical and Computer Engineering, minor from the Department of Mathematics, North Carolina State University, USA in 2006. Currently, he is a professor with the Department of Electronic Engineering, Shanghai Jiao Tong University, China. He has been an associate editor for the IEEE/ACM Transactions on Networking and the IEEE Transactions on Mobile Computing, and the member of the technical program committees of several conferences including ACM MobiCom 2012, ACM MobiHoc 2012–2014, and IEEE INFOCOM 2009–2017.

Jing Zhang received the BS degree in geochemistry from Nanjing University, China in 1982, the MS degree from the Department of Marine Geology, Shandong College of Oceanography, China in 1985, and the PhD degree in geochemistry from Pierre and Marie Curie University, France in 1988. Currently, he is a professor in the School of Oceanography, Shanghai Jiao Tong University, China.

Chenghu Zhou received the BS degree in geography from Nanjing University, China in 1984, and the MS and PhD degrees in geographic information system from the Chinese Academy of Sciences (CAS), China in 1987 and 1992, respectively. He is currently an academician with CAS, where he is also a research professor with the Institute of Geographical Sciences and Natural Resources Research, and a professor with the School of Geography and Ocean Science, Nanjing University, China. His research interests include spatial and temporal data mining, geographic modeling, hydrology and water resources, and geographic information systems and remote sensing applications.

Electronic Supplementary Material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, Q., Wang, X., Fu, L. et al. VSAN: A new visualization method for super-large-scale academic networks. Front. Comput. Sci. 18, 181701 (2024). https://doi.org/10.1007/s11704-022-2078-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-022-2078-5

Keywords

Search

Navigation