GraphITE: Estimating Individual Effects of Graph-structured Treatments

被引:0
|
作者
Harada S. [1 ]
Kashima H. [1 ]
机构
[1] Kyoto University, Japan
关键词
causal inference; graph neural networks; treatment effect estimation;
D O I
10.1527/tjsai.37-2_D-M73
中图分类号
学科分类号
摘要
Outcome estimation of treatments for individual targets is a crucial foundation for decision making based on causal relations. Most of the existing outcome estimation methods deal with binary or multiple-choice treatments; however, in some applications, the number of interventions can be very large, while the treatments themselves have rich information. In this study, we consider one important instance of such cases, that is, the outcome estimation problem of graph-structured treatments such as drugs. Due to the large number of possible interventions, the coun-terfactual nature of observational data, which appears in conventional treatment effect estimation, becomes a more serious issue in this problem. Our proposed method GraphITE (pronounced ‘graphite’) obtains the representations of the graph-structured treatments using graph neural networks, and also mitigates the observation biases by using the HSIC regularization that increases the independence of the representations of the targets and the treatments. In con-trast with the existing methods, which cannot deal with “zero-shot” treatments that are not included in observational data, GraphITE can efficiently handle them thanks to its capability of incorporating graph-structured treatments. The experiments using the two real-world datasets show GraphITE outperforms baselines especially in cases with a large number of treatments. © 2022, Japanese Society for Artificial Intelligence. All rights reserved.
引用
收藏
相关论文
共 50 条
  • [31] Path to fixation of evolutionary processes in graph-structured populations
    Mahdi Hajihashemi
    Keivan Aghababaei Samani
    The European Physical Journal B, 2021, 94
  • [32] GrapHisto: A Robust Representation of Graph-Structured Data for Graph Convolutional Networks
    Benini, Marco
    Bongini, Pietro
    Trentin, Edmondo
    NEURAL PROCESSING LETTERS, 2025, 57 (01)
  • [33] Classifier construction by graph-based induction for graph-structured data
    Geamsakul, W
    Matsuda, T
    Yoshida, T
    Motoda, H
    Washio, T
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, 2003, 2637 : 52 - 62
  • [34] Graph-Informed Neural Networks for Regressions on Graph-Structured Data
    Berrone, Stefano
    Della Santa, Francesco
    Mastropietro, Antonio
    Pieraccini, Sandra
    Vaccarino, Francesco
    MATHEMATICS, 2022, 10 (05)
  • [35] Graph-Structured Sparse Optimization for Connected Subgraph Detection
    Zhou, Baojian
    Chen, Feng
    2016 IEEE 16TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2016, : 709 - 718
  • [36] Graph-structured multitask sparsity model for visual tracking
    Sun, Jun
    Chen, Qidong
    Sun, Jianan
    Zhang, Tao
    Fang, Wei
    Wu, Xiaojun
    INFORMATION SCIENCES, 2019, 486 : 133 - 147
  • [37] Preserving the Privacy of Latent Information for Graph-Structured Data
    Shan, Baoling
    Yuan, Xin
    Ni, Wei
    Wang, Xin
    Liu, Ren Ping
    Dutkiewicz, Eryk
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2023, 18 : 5041 - 5055
  • [38] Path to fixation of evolutionary processes in graph-structured populations
    Hajihashemi, Mahdi
    Samani, Keivan Aghababaei
    EUROPEAN PHYSICAL JOURNAL B, 2021, 94 (02):
  • [39] Extending Complex Event Processing to Graph-structured Information
    Barquero, Gala
    Burgueno, Loli
    Troya, Javier
    Vallecillo, Antonio
    21ST ACM/IEEE INTERNATIONAL CONFERENCE ON MODEL DRIVEN ENGINEERING LANGUAGES AND SYSTEMS (MODELS 2018), 2018, : 166 - 175
  • [40] Dual Averaging Method for Online Graph-structured Sparsity
    Zhou, Baojian
    Chen, Feng
    Ying, Yiming
    KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 436 - 446