最短路径还是随机游走?网络Meta分析中路径权重的框架
该文将网络Meta分析中比较或单一研究贡献的量化研究扩展到证据路径的贡献。提出基于路径设计矩阵的通用框架,将路径贡献问题描述为线性方程,并证明最短路径和随机游走两种已知方法是满足最小化绝对路径贡献之和优化准则的特解。在大网络中,最短路径在运行时间和变异性方面优于其他方法,因此推荐实际使用。
要点
- 路径贡献问题可表示为基于路径设计矩阵的线性方程,解可能含负系数。
- 最短路径和随机游走均为该方程的特解,且满足最小化绝对路径贡献之和的优化准则。
- 在大网络中,最短路径在运行时间和变异性方面优于其他方法,被推荐用于实践。
核心结论
- 最短路径方法在大网络中运行时间和变异性方面优于其他方法,因此推荐实际使用。
- 路径权重框架有潜力回答网络Meta分析中更一般的研究问题。
研究设计与样本
- 方法学研究,提出基于路径设计矩阵的通用框架,将路径贡献问题描述为线性方程。
- 通过广义逆(Moore-Penrose伪逆)识别无限解集,并考虑另外两种特殊方法。
主要发现
- 最短路径和随机游走是线性方程的特解,均满足最小化绝对路径贡献之和的优化准则。
- 在大网络中,最短路径在运行时间和变异性方面优于其他方法。
临床怎么用
- 作者推荐在大网络的实际应用中采用最短路径方法。
局限性
- 原文未报告局限性。
以上解读依据论文摘要(全文未开放获取或许可不允许翻译转载)。
原文
Quantifying the contributions, or weights, of comparisons or single studies to the estimates in a network meta-analysis (NMA) is an active area of research. We extend this work to include the contributions of paths of evidence. We present a general framework, based on the path-design matrix, that describes the problem of finding path contributions as a linear equation. The resulting solutions may have negative coefficients. We show that two known approaches, called shortestpath and randomwalk, are special solutions of this equation, and both meet an optimization criterion, as they minimize the sum of absolute path contributions. In general, there is an infinite set of solutions, which can be identified using the generalized inverse (Moore-Penrose pseudoinverse). We consider two further special approaches. For large networks we find that shortestpath is superior with respect to run time and variability, compared to the other approaches, and is thus recommended in practice. The path-weights framework also has the potential to answer more general research questions in NMA.
引用
- Rücker G, Papakonstantinou T, Nikolakopoulou A, et al. Shortest path or random walks? A framework for path weights in network meta-analysis. Stat Med. 2024. PMID: 39044353. doi:10.1002/sim.10177
供执业医师工作参考,不替代临床判断;数值与分级以指南原文为准。