Multivariate Network Layout Using Force-Directed Method with Attribute Constraints
Source abstract
Abstract
Graph visualization with proper layout is widely applied to understand the relationship between entities in a complex system and the topological structure information is mainly used. Real-world graphs often have the community structures property which is ignored in many existing graph layout methods. Thus, we propose a multivariate network layout method using the force-directed method with attribute constraints. This method can effectively take into account the hierarchical structure, connection strength, and quantitative comparison between communities. First, the layout of community centers is generated by a force-directed algorithm in which node count of the community is taken as constraints to enable area balance of community; Second, community force based on node attribute is added in the force-directed algorithm to maintain the community clarity. A visualization system is also developed to allow users to interactively generate community structure-aware layout results. qualitative and quantitative evaluation of the results verifies the usability and effectiveness of the proposed method by comparing it with other methods.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Data Visualization and Analytics · Complex Network Analysis Techniques · Advanced Text Analysis Techniques
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Aerospace Information Research Institute, Chinese Academy of Sciences, Beijing 100094, China
Key Laboratory of Network Information System Technology (NIST), Aerospace Information Research Institute, Chinese Academy of Sciences, Beijing 100190, China
University of Chinese Academy of Sciences, Beijing 100190, China
School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences, Beijing 100190, China
References (48)
Show source-provided references
1. Scalable, versatile and simple constrained graph layout10.1111/j.1467-8659.2009.01449.x ↗
2. The state of the art in visualizing multivariate networks10.1111/cgf.13728 ↗
3. Boz, H.A., Bahrami, M., Suhara, Y., Bozkaya, B., and Balcısoy, S. (2020, January 25). An exploratory visual analytics tool for multivariate dynamic networks. Proceedings of the EuroVis Workshop on Visual Analytics (EuroVA), Online.
4. Visual Neural Decomposition to Explain Multivariate Data Sets10.1109/TVCG.2020.3030420 ↗
5. Heer, J., and Boyd, D. (, January 23–25). Vizster: Visualizing online social networks. Proceedings of the IEEE Symposium on Information Visualization 2005, INFOVIS 2005, Minneapolis, MN, USA.
6. Polaris: A system for query, analysis, and visualization of multidimensional relational databases10.1109/2945.981851 ↗
7. Kreuseler, M., López, N., and Schumann, H. (2000, January 9–10). A scalable framework for information visualization. Proceedings of the IEEE Symposium on Information Visualization 2000, INFOVIS 2000, Salt Lake City, UT, USA.
8. Li, R., Song, S., Wu, Q., and John, L.K. (2020, January 16–19). Accelerating Force-directed Graph Layout with Processing-in-Memory Architecture. Proceedings of the 2020 IEEE 27th International Conference on High Performance Computing, Data, and Analytics (HiPC), Pune, India.10.1109/HiPC50609.2020.00041 ↗
9. DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction10.1109/TVCG.2020.3030447 ↗
10. Graph drawing by force-directed placement10.1002/spe.4380211102 ↗
11. Harel, D., and Koren, Y. (2000). A fast multi-scale method for drawing large graphs. International Symposium on Graph Drawing, Springer.10.1145/345513.345353 ↗
12. Hachul, S., and Jünger, M. (2004). Drawing large graphs with a potential-field-based multilevel algorithm. International Symposium on Graph Drawing, Springer.10.1007/978-3-540-31843-9_29 ↗
13. Gajer, P., and Kobourov, S.G. (2000). Grip: Graph drawing with intelligent placement. International Symposium on Graph Drawing, Springer.10.1007/3-540-44541-2_21 ↗
14. Harel, D., and Koren, Y. (2002). Graph drawing by high-dimensional embedding. International Symposium on Graph Drawing, Springer.10.1007/3-540-36151-0_20 ↗
15. Graph Layouts by t-SNE10.1111/cgf.13187 ↗
16. Brandes, U., and Pich, C. (2006). Eigensolver methods for progressive multidimensional scaling of large data. International Symposium on Graph Drawing, Springer.
17. On the readability of graphs using node-link and matrix-based representations: A controlled experiment and statistical analysis10.1057/palgrave.ivs.9500092 ↗
18. NodeTrix: A hybrid visualization of social networks10.1109/TVCG.2007.70582 ↗
19. Wattenberg, M. (2006, January 22–27). Visual exploration of multivariate graphs. Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Montréal, QC, Canada.10.1145/1124772.1124891 ↗
20. 1.5 D egocentric dynamic network visualization10.1109/TVCG.2014.2383380 ↗
21. Force-directed algorithms for schematic drawings and placement: A survey10.1177/1473871618821740 ↗
22. Improving multiple aesthetics produces better graph drawings10.1016/j.jvlc.2011.12.002 ↗
23. How to draw a graph10.1112/plms/s3-13.1.743 ↗
24. A heuristic for graph drawing
25. An algorithm for drawing general undirected graphs10.1016/0020-0190(89)90102-6 ↗
26. Energy models for graph clustering10.7155/jgaa.00154 ↗
27. Jacomy, M., Venturini, T., Heymann, S., and Bastian, M. (2014). ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLoS ONE, 9.10.1371/journal.pone.0098679 ↗
28. Gansner, E.R., Koren, Y., and North, S. (2004). Graph drawing by stress majorization. International Symposium on Graph Drawing, Springer.10.1007/978-3-540-31843-9_25 ↗
29. Koren, Y., and Civril, A. (2008). The binary stress model for graph drawing. International Symposium on Graph Drawing, Springer.10.1007/978-3-642-00219-9_19 ↗
30. Constrained graph layout by stress majorization and gradient projection10.1016/j.disc.2007.12.103 ↗
31. Stress functions for nonlinear dimension reduction, proximity analysis, and graph drawing
32. Ko, Y.J., and Yen, H.C. (2016, January 19–22). Drawing clustered graphs using stress majorization and force-directed placements. Proceedings of the 2016 20th International Conference Information Visualisation (IV), IEEE, Lisbon, Portugal.10.1109/IV.2016.52 ↗
33. Tamassia, R. (2013). Handbook of Graph Drawing and Visualization, CRC Press.10.1201/b15385 ↗
34. Drawing graphs nicely using simulated annealing10.1145/234535.234538 ↗
35. Module-based visualization of large-scale graph network data10.1007/s12650-016-0375-5 ↗
36. Visualizing hierarchical social networks10.1177/2378023118772982 ↗
37. PLANET: A radial layout algorithm for network visualization10.1016/j.physa.2019.122948 ↗
38. Multivariate network exploration and presentation: From detail to overview via selections and aggregations10.1109/TVCG.2014.2346441 ↗
39. Visual analysis of large heterogeneous social networks by semantic and structural abstraction10.1109/TVCG.2006.107 ↗
40. OnionGraph: Hierarchical topology+ attribute multivariate network visualization10.1016/j.visinf.2020.01.002 ↗
41. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data10.1109/TVCG.2006.147 ↗
42. Edge bundling in information visualization10.1109/TST.2013.6509098 ↗
43. Pienta, R., Kahng, M., Lin, Z., Vreeken, J., Talukdar, P., Abello, J., Parameswaran, G., and Chau, D.H. (2017, January 27–29). Facets: Adaptive local exploration of large graphs. Proceedings of the 2017 SIAM International Conference on Data Mining. SIAM, Houston, TX, USA.10.1137/1.9781611974973.67 ↗
44. Visual recommendations for network navigation10.1111/j.1467-8659.2011.01957.x ↗
45. Refinery: Visual exploration of large, heterogeneous networks through associative browsing10.1111/cgf.12642 ↗
46. Laumond, A., Melançon, G., and Pinaud, B. (2017, January 1–6). eDOI: Exploratory degree of interest exploration of multilayer networks based on user interest. Proceedings of the VIS 2017, Poster Session, Phoenix, AZ, USA.
47. Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search10.1109/TKDE.2003.1208999 ↗
48. (2021, June 05). IEEE VAST Challenge. Available online: http://www.vacommunity.org/VAST+Challenge+2012.