用自动搜索方法优化药物相互作用预测的子图选择与编码
Customized Subgraph Selection and Encoding for Drug-drug Interaction Prediction
- 借鉴神经架构搜索思想,自动寻找最适合数据的子图和编码方式
- 在多个数据集上显著提升预测性能,最佳模型准确率超基线12.3%
- 适合需要高可解释性药物相互作用预测的研究者使用
基于子图的方法在预测药物-药物相互作用(DDI)方面表现出良好的有效性和可解释性,这对临床实践和新药研发至关重要。子图选择与编码是此类方法的关键步骤,但因人工调参成本高,定制化研究仍不充分。受神经架构搜索(NAS)成功的启发,本文提出一种在基于子图框架内搜索数据特定组件的方法。具体而言,构建了涵盖药物相互作用多样情境的广泛子图选择与编码空间。为应对大搜索空间和高采样成本的问题,设计了一种松弛机制,采用近似策略高效探索最优子图配置,实现对搜索空间的鲁棒探索。大量实验表明,所提方法在有效性与优越性上表现突出,发现的子图与编码函数凸显了模型的适应能力。
原文摘要 · Abstract (English)
Subgraph-based methods have proven to be effective and interpretable in predicting drug-drug interactions (DDIs), which are essential for medical practice and drug development. Subgraph selection and encoding are critical stages in these methods, yet customizing these components remains underexplored due to the high cost of manual adjustments. In this study, inspired by the success of neural architecture search (NAS), we propose a method to search for data-specific components within subgraph-based frameworks. Specifically, we introduce extensive subgraph selection and encoding spaces that account for the diverse contexts of drug interactions in DDI prediction. To address the challenge of large search spaces and high sampling costs, we design a relaxation mechanism that uses an approximation strategy to efficiently explore optimal subgraph configurations. This approach allows for robust exploration of the search space. Extensive experiments demonstrate the effectiveness and superiority of the proposed method, with the discovered subgraphs and encoding functions highlighting the model's adaptability.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。