ADiffGDA: Exploring Gene-Drug Associations via Adaptive Graph Diffusion Networks

Exploring gene-drug associations is a key step in identifying new drug candidates, but traditional experimental methods are often expensive and time-consuming. While Graph Neural Network (GNN)-based models have demonstrated effectiveness in association prediction tasks, they face challenges in the information aggregation process. Existing GNN models either treat all nodes uniformly or rely on simple attention mechanisms to assign weights to neighboring nodes, limiting their capacity to capture complex relationships and improve performance. To address these limitations, we propose a novel adaptive graph diffusion network, ADiffGDA, for gene-drug association prediction. The model begins by randomly initializing embeddings for genes and drugs, which are then updated through neighborhood information aggregation. A key feature of ADiffGDA is the incorporation of a heat kernel, enabling each node to dynamically adjust aggregation weights based on its local structure. This approach allows the model to better capture variations in node types and local neighborhood patterns. Through extensive comparative experiments, we show that ADiffGDA outperforms existing state-of-the-art methods. Furthermore, case studies validate its effectiveness as a predictive tool, offering valuable insights for future biological experiments. The code and datasets for ADiffGDA are freely available at https://github.com/one-melon/ADiffGDA.

Authors

Institutions

Publication Details

Published
2024-12-03
DOI
https://doi.org/10.1109/bibm62325.2024.10821876
Primary Topic
Bioinformatics and Genomic Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ADiffGDA: Exploring Gene-Drug Associations via Adaptive Graph Diffusion Networks

Yurong Qian, Yanhao Fan, Che Zhang, Xiaowen Hu et al.
Bioinformatics and Genomic Networks
article

ADiffGDA: Exploring Gene-Drug Associations via Adaptive Graph Diffusion Networks

Yurong Qian, Yanhao Fan, Che Zhang, Xiaowen Hu, Lei Deng
article en

Abstract

Exploring gene-drug associations is a key step in identifying new drug candidates, but traditional experimental methods are often expensive and time-consuming. While Graph Neural Network (GNN)-based models have demonstrated effectiveness in association prediction tasks, they face challenges in the information aggregation process. Existing GNN models either treat all nodes uniformly or rely on simple attention mechanisms to assign weights to neighboring nodes, limiting their capacity to capture complex relationships and improve performance. To address these limitations, we propose a novel adaptive graph diffusion network, ADiffGDA, for gene-drug association prediction. The model begins by randomly initializing embeddings for genes and drugs, which are then updated through neighborhood information aggregation. A key feature of ADiffGDA is the incorporation of a heat kernel, enabling each node to dynamically adjust aggregation weights based on its local structure. This approach allows the model to better capture variations in node types and local neighborhood patterns. Through extensive comparative experiments, we show that ADiffGDA outperforms existing state-of-the-art methods. Furthermore, case studies validate its effectiveness as a predictive tool, offering valuable insights for future biological experiments. The code and datasets for ADiffGDA are freely available at https://github.com/one-melon/ADiffGDA.

Central South University (CN), Xinjiang University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 78%
Bioinformatics and Genomic Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.