Premium
Automated drawing of network plots in network meta‐analysis
Author(s) -
Rücker Gerta,
Schwarzer Guido
Publication year - 2016
Publication title -
research synthesis methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.376
H-Index - 35
eISSN - 1759-2887
pISSN - 1759-2879
DOI - 10.1002/jrsm.1143
Subject(s) - computer science , network analysis , graph , software , representation (politics) , theoretical computer science , graph theory , graph drawing , data mining , mathematics , programming language , law , physics , quantum mechanics , combinatorics , politics , political science
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.