计算机科学
网络分析
图形
软件
代表(政治)
理论计算机科学
图论
图形绘制
数据挖掘
数学
程序设计语言
法学
物理
量子力学
组合数学
政治
政治学
作者
Gerta Rücker,Guido Schwarzer
摘要
In systematic reviews based on network meta‐analysis, the network structure should be visualized. Network plots often have been drawn by hand using generic graphical software. A typical way of drawing networks, also implemented in statistical software for network meta‐analysis, is a circular representation, often with many crossing lines. We use methods from graph theory in order to generate network plots in an automated way. We give a number of requirements for graph drawing and present an algorithm that fits prespecified ideal distances between the nodes representing the treatments. The method was implemented in the function netgraph of the R package netmeta and applied to a number of networks from the literature. We show that graph representations with a small number of crossing lines are often preferable to circular representations. Copyright © 2015 John Wiley & Sons, Ltd.
科研通智能强力驱动
Strongly Powered by AbleSci AI