arXiv:2412.19507cs.AI2024-12IJCAI被引 2

融合约束与评分方法,提升目标变量因果关系发现准确性

Hybrid Local Causal Discovery

  • 先用约束法结合或规则生成候选骨架,再用评分法剔除冗余边
  • 在方向推断阶段通过结构得分比较区分V型结构与等价类
  • 在14个数据集上优于7种现有算法,显著减少错误传播

局部因果发现旨在从观测数据中学习并区分目标变量的直接因果关系。现有基于约束的方法在构建局部因果骨架时使用与或规则,单独使用任一规则易引发错误传播,影响因果关系推断。而直接将基于评分的全局方法应用于局部发现,可能因局部等价类存在而随机返回错误结果。为此,本文提出混合局部因果发现算法HLCD:首先采用结合或规则的约束方法获得候选骨架,再通过评分方法消除冗余边;在局部方向推断阶段,通过比较V型结构与等价类的局部结构得分,避免等价类导致的方向干扰。我们在14个基准贝叶斯网络数据集上与7种先进算法进行对比实验,结果表明HLCD显著优于现有方法。

原文摘要 · Abstract (English)

Local causal discovery aims to learn and distinguish the direct causes and effects of a target variable from observed data. Existing constraint-based local causal discovery methods use AND or OR rules in constructing the local causal skeleton, but using either rule alone is prone to produce cascading errors in the learned local causal skeleton, and thus impacting the inference of local causal relationships. On the other hand, directly applying score-based global causal discovery methods to local causal discovery may randomly return incorrect results due to the existence of local equivalence classes. To address the above issues, we propose a Hybrid Local Causal Discovery algorithm, called HLCD. Specifically, HLCD initially utilizes a constraint-based approach combined with the OR rule to obtain a candidate skeleton and then employs a score-based method to eliminate redundant portions in the candidate skeleton. Furthermore, during the local causal orientation phase, HLCD distinguishes between V-structures and equivalence classes by comparing the local structure scores between the two, thereby avoiding orientation interference caused by local equivalence classes. We conducted extensive experiments with seven state-of-the-art competitors on 14 benchmark Bayesian network datasets, and the experimental results demonstrate that HLCD significantly outperforms existing local causal discovery algorithms.

因果发现局部因果混合方法

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。