跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要明确以变量间高斯图网络的构建和连边检验为目标,支持网络结构分析方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Faming Liang
Qifan Song
Peihua Qiu

高维高斯图模型中用于网络构建的等价偏相关度量

研究问题
当变量数超过样本量、完整偏相关难以估计时,如何用较小条件集合度量变量关联,并据此恢复高斯图网络的连边结构?
方法与思路
作者提出基于缩减条件集合的偏相关度量,在 Markov 性与邻接忠实性条件下论证其网络构建等价性,并设计多重检验方法。
材料陈述的贡献
摘要称,方法在一定条件下一致,尤其在间接关联较多时优于所列比较方法,并具有近似二次量级的计算复杂度及整合灵活性。
阅读关注点
应核对缩减条件集合如何确定、等价性是否仅针对连边判定,以及多重检验控制、一致性条件和复杂度分析的适用范围。
阅读边界
仅据版本未注明的 OpenAlex 索引摘要,无法确认比较设置或复杂度细节;网络构建等价不应解释为偏相关数值必然相等,刊本变化未核验。

原文摘要

Gaussian graphical models (GGMs) are frequently used to explore networks, such as gene regulatory networks, among a set of variables. Under the classical theory of GGMs, the construction of Gaussian graphical networks amounts to finding the pairs of variables with nonzero partial correlation coefficients. However, this is infeasible for high-dimensional problems for which the number of variables is larger than the sample size. In this article, we propose a new measure of partial correlation coefficient, which is evaluated with a reduced conditional set and thus feasible for high-dimensional problems. Under the Markov property and adjacency faithfulness conditions, the new measure of partial correlation coefficient is equivalent to the true partial correlation coefficient in construction of Gaussian graphical networks. Based on the new measure of partial correlation coefficient, we propose a multiple hypothesis test-based method for the construction of Gaussian graphical networks. Furthermore, we establish the consistency of the proposed method under mild conditions. The proposed method outperforms the existing methods, such as the PC, graphical Lasso, nodewise regression, and qp-average methods, especially for the problems for which a large number of indirect associations are present. The proposed method has a computational complexity of nearly O(p2), and is flexible in data integration, network comparison, and covariate adjustment.

笔记与分组
相关领域论文