Network Meta-Analysis

版本 1.1.0.0 (18.4 KB) 作者: Jan Motl
Performs a network meta-analysis
226.0 次下载
更新时间 2016/4/24

查看许可证

Algorithm properties:
1) graphRank permits missing values.
2) graphRank permits multiple, possibly non-agreeing, responses per
block and treatment.
3) graphRank permits existence of cycles between the treatments (see
algorithm description for details).
4) graphRank does NOT produce p-values. It just ranks the treatments.
5) In the case of balanced data, graphRank produces results equivalent
to count of wins.
Dependencies:
Matlab BGL: http://dgleich.github.com/matlab-bgl/

Algorithm description:
The algorithm counts pairwise wins of treatments over blocks.
The wins are then represented in a form of a directed graph.
If treatment1 wins over treatment2 more times than treatment2
wins over threatmen1, the victory is represented with a directed edge
from treatment2 to treatment1. If reverse is true, the edge goes
from treatment1 to treatment2. In absence of any comparison between
treatment1 and treatment2 or in the case of a tie, no edge is placed
between treatment1 and treatment2.

Once the data are in a form of a directed graph, the nodes are ordered
with a modified topological sort inspired by:
A Simple Algorithm for Automatic Layout of BPMN Processes
(http://dx.doi.org/10.1109/CEC.2009.28)
Just like the referenced topological algorithm, the implemented sort
returns a plausible order of nodes even in the presence of loops in the
graph. The only difference is that:
1) The returned order of nodes is between 0 and 1.
2) All unbeaten treatments are assigned value 1.
3) All winless treatments are assigned value 0.
4) Treatments that are both, unbeaten and winless, are assigned
value 0 (the assigned value is just a matter of definition).
5) The gaps between the nodes on a path from a winless treatment to an
unbeaten treatment are set to be of equal distance. For example in:

A---------->B
\--->C--->/

the node C gets assigned a value of 0.5, because value of 0.5 is
exactly in the middle between 0 (a value of node A) and 1 (a value of
node B).

引用格式

Jan Motl (2024). Network Meta-Analysis (https://www.mathworks.com/matlabcentral/fileexchange/55555-network-meta-analysis), MATLAB Central File Exchange. 检索来源 .

MATLAB 版本兼容性
创建方式 R2015a
兼容任何版本
平台兼容性
Windows macOS Linux
类别
Help CenterMATLAB Answers 中查找有关 Directed Graphs 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
版本 已发布 发行说明
1.1.0.0

Considers all plausible orderings of the treatments, not just the pessimistic/optimistic orderings.

1.0.0.0