Molecular interaction prediction plays a crucial role in forecasting unknown interactions between molecules, such as drug-target interaction (DTI) and drug-drug interaction (DDI), which are essential in the field of drug discovery and therapeutics. Although previous prediction methods have yielded promising results by leveraging the rich semantics and topological structure of biomedical knowledge graphs (KGs), they have primarily focused on enhancing predictive performance without addressing the presence of inevitable noise and inconsistent semantics. This limitation has hindered the advancement of KGbased prediction methods. To address this limitation, we propose BioKDN (Biomedical Knowledge Graph Denoising Network) for robust molecular interaction prediction. BioKDN refines the reliable structure of local subgraphs by denoising noisy links in a learnable manner, providing a general module for extracting task-relevant interactions. To enhance the reliability of the refined structure, BioKDN maintains consistent and robust semantics by smoothing relations around the target interaction. By maximizing the mutual information between reliable structure and smoothed relations, BioKDN emphasizes informative semantics to enable precise predictions. Experimental results on real-world datasets show that BioKDN surpasses state-of-theart models in DTI and DDI prediction tasks, confirming the effectiveness and robustness of BioKDN in denoising unreliable interactions within contaminated KGs
This paper presents a technique to model statically indeterminate forces based on stiffness matrices for multi-limbed climbing robots. Current wall climbing robots in literature overlook statically indeterminate forces, causing an incapability to estimate climbing failure under certain circumstances. Accounting for these forces, robot deformation can be approximated, paving the way for the proposed two-wall climbing approach. During a wall climb, two failure modes, slide and over-torque, are identified to compute feasible climbing region. A hexapod robot is used to verify the proposed technique by climbing between walls with pure friction end effectors.
6 February 2026 in Tsinghua Science and Technology
Drug repositioning has been widely applied to explore new therapeutic applications for existing drugs, significantly reducing the transition time from laboratory research to clinical application. However, most existing models rely on static training over complex and large-scale networks, lacking detailed analysis and specificity for individual drug-disease pairs. To address this limitation, we propose the subgraph-aware graph attention network (SAGAN), which constructs subgraphs centered on target drug-disease pairs by extracting their surrounding interactions. Within each extracted subgraph, SAGAN employs an attention mechanism to focus on critical interactions among directly associated nodes within the subgraph, while simultaneously capturing cross-level relational patterns. A hierarchical pooling technique is then applied to aggregate the nodes and edges within the subgraph into more compact representations. Additionally, SAGAN integrates neighborhood features and interaction information from drug and disease similarity networks to enhance the expressive power of subgraph features. Finally, the method predicts drug-disease associations as a graph classification task. On three widely used benchmark datasets, SAGAN demonstrates outstanding performance, achieving an average area under the receiver operating characteristic curve (AUROC) of 0.9648 and an average area under the precision-recall curve (AUPR) of 0.9678, showcasing its robustness in handling sparse and imbalanced data. Furthermore, case studies validate the practical utility of SAGAN in predicting potential effective drugs for Alzheimer’s disease and breast cancer.
6 June 2025 in Interdisciplinary Sciences: Computational Life Sciences