A Many-objective Evolutionary Algorithm Approach for Graph Visualization

被引:0
作者
Khan, Burhan [1 ]
Johnstone, Michael [1 ]
Creighton, Douglas [1 ]
机构
[1] Deakin Univ, Inst Intelligent Syst Res & Innovat IISRI, Geelong, Vic 3217, Australia
来源
18TH ANNUAL IEEE INTERNATIONAL SYSTEMS CONFERENCE, SYSCON 2024 | 2024年
关键词
Causal-loop Diagram; Aesthetics; Evolutionary Computation; Graph Layout; Many-Objective; Multi-Objective; Optimization;
D O I
10.1109/SysCon61195.2024.10553494
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Determining the layout of a graph from an aesthetic point-of-view is a challenging task and becomes difficult with the increase in complexity of a graph. Aesthetic attributes of graphs can be captured in terms of metrics such as the number of edge crossings, uniform edge lengths, visualization of loops in causal loop diagrams, and a minimum distance between neighboring nodes. These metrics are then used as objectives in an evolutionary algorithm to obtain the optimal set of trade-off solutions, leading to a pleasing layout. As the number of aesthetic measures could be more than three, we propose a framework based on a many-objective evolutionary algorithm to produce aesthetically pleasing graph layouts. The outcome of this approach is compared with the ForceAtlas2 force-directed layout algorithm and the proposed approach demonstrates better results for the objectives.
引用
收藏
页数:7
相关论文
共 33 条
[1]   A Community Based Systems Diagram of Obesity Causes [J].
Allender, Steven ;
Owen, Brynle ;
Kuhlberg, Jill ;
Lowe, Janette ;
Nagorcka-Smith, Phoebe ;
Whelan, Jill ;
Bell, Colin .
PLOS ONE, 2015, 10 (07)
[2]  
Bach Benjamin, 2013, Graph Drawing. 20th International Symposium, GD 2012. Revised Selected Papers, P541, DOI 10.1007/978-3-642-36763-2_48
[3]  
Burch M, 2012, LECT NOTES COMPUT SC, V7034, P226
[4]   Drawing graphs nicely using simulated annealing [J].
Davidson, R ;
Harel, D .
ACM TRANSACTIONS ON GRAPHICS, 1996, 15 (04) :301-331
[5]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[6]   A Survey on Graph Drawing Beyond Planarity [J].
Didimo, Walter ;
Liotta, Giuseppe ;
Montecchiani, Fabrizio .
ACM COMPUTING SURVEYS, 2019, 52 (01)
[7]  
Dubec P, 2013, COMM COM INF SC, V368, P194
[8]   GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT [J].
FRUCHTERMAN, TMJ ;
REINGOLD, EM .
SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) :1129-1164
[9]  
Huang Jing-wei, 2003, Wuhan University Journal of Natural Sciences, V8, P212, DOI 10.1007/BF02899481
[10]  
Huang W., 2016, arXiv