Context-Aware Safe Medication Recommendations with Molecular Graph and DDI Graph Embedding

被引:0
|
作者
Chen, Qianyu [1 ]
Li, Xin [1 ]
Geng, Kunnan [1 ]
Wang, Mingzhong [2 ]
机构
[1] Beijing Inst Technol, Beijing, Peoples R China
[2] Univ Sunshine Coast, Sippy Downs, Qld, Australia
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Molecular structures and Drug-Drug Interactions (DDI) are recognized as important knowledge to guide medication recommendation (MR) tasks, and medical concept embedding has been applied to boost their performance. Though promising performance has been achieved by leveraging Graph Neural Network (GNN) models to encode the molecular structures of medications or/and DDI, we observe that existing models are still defective: 1) to differentiate medications with similar molecules but different functionality; or/and 2) to properly capture the unintended reactions between drugs in the embedding space. To alleviate this limitation, we propose Carmen, a cautiously designed graph embedding-based MR framework. Carmen consists of four components, including patient representation learning, context information extraction, context-aware GNN, and DDI encoding. Carmen incorporates the visit history into the representation learning of molecular graphs to distinguish molecules with similar topology but dissimilar activity. Its DDI encoding module is specially devised for the non-transitive interaction DDI graphs. The experiments on real-world datasets demonstrate that Carmen achieves remarkable performance improvement over state-of-the-art models and can improve the safety of recommended drugs with proper DDI graph encoding.
引用
收藏
页码:7053 / 7060
页数:8
相关论文
共 50 条
  • [1] Context-Aware Temporal Knowledge Graph Embedding
    Liu, Yu
    Hua, Wen
    Xin, Kexuan
    Zhou, Xiaofang
    [J]. WEB INFORMATION SYSTEMS ENGINEERING - WISE 2019, 2019, 11881 : 583 - 598
  • [2] Pairwise Intent Graph Embedding Learning for Context-Aware Recommendation
    Liu, Dugang
    Wu, Yuhao
    Li, Weixin
    Zhang, Xiaolian
    Wang, Hao
    Yang, Qinjuan
    Ming, Zhong
    [J]. PROCEEDINGS OF THE 17TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, RECSYS 2023, 2023, : 588 - 598
  • [3] Context-Aware Service Recommendation Based on Knowledge Graph Embedding
    Mezni, Haithem
    Benslimane, Djamal
    Bellatreche, Ladjel
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (11) : 5225 - 5238
  • [4] LightCAKE: A Lightweight Framework for Context-Aware Knowledge Graph Embedding
    Ning, Zhiyuan
    Qiao, Ziyue
    Dong, Hao
    Du, Yi
    Zhou, Yuanchun
    [J]. ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2021, PT III, 2021, 12714 : 181 - 193
  • [5] CAKE: A Context-Aware Knowledge Embedding Model of Knowledge Graph
    Chen, Jiadong
    Ke, Hua
    Mo, Haijian
    Gao, Xiaofeng
    Chen, Guihai
    [J]. DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2022, PT I, 2022, 13426 : 48 - 62
  • [6] Context-aware Graph Embedding for Session-based News Recommendation
    Sheu, Heng-Shiou
    Li, Sheng
    [J]. RECSYS 2020: 14TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2020, : 657 - 662
  • [7] POI Recommendation Based on Multidimensional Context-aware Graph Embedding Model
    Chen, Jin-Song
    Meng, Xiang-Wu
    Ji, Wei-Yu
    Zhang, Yu-Jie
    [J]. Ruan Jian Xue Bao/Journal of Software, 2020, 31 (12): : 3700 - 3715
  • [8] User-Event Graph Embedding Learning for Context-Aware Recommendation
    Liu, Dugang
    He, Mingkai
    Luo, Jinwei
    Lin, Jiangxu
    Wang, Meng
    Zhang, Xiaolian
    Pan, Weike
    Ming, Zhong
    [J]. PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 1051 - 1059
  • [9] Context-aware graph-based recommendations exploiting Personalized PageRank
    Musto, Cataldo
    Lops, Pasquale
    de Gemmis, Marco
    Semeraro, Giovanni
    [J]. KNOWLEDGE-BASED SYSTEMS, 2021, 216
  • [10] Context-Aware Graph Convolutional Autoencoder
    Sattar, Asma
    Bacciu, Davide
    [J]. ADVANCES IN COMPUTATIONAL INTELLIGENCE, IWANN 2021, PT I, 2021, 12861 : 279 - 290