8 January 2024 in IEEE Journal of Biomedical and Health Informatics
Drug-target binding affinity prediction plays an important role in the early stages of drug discovery, which can infer the strength of interactions between new drugs and new targets. However, the performance of previous computational models is limited by the following drawbacks. The learning of drug representation relies only on supervised data without considering the information in the molecular graph itself. Moreover, most previous studies tended to design complicated representation learning modules, while uniformity used to measure representation quality is ignored. In this study, we propose GraphCL-DTA, a graph contrastive learning with molecular semantics for drug-target binding affinity prediction. This graph contrastive learning framework replaces the dropout-based data augmentation strategy by performing data augmentation in the embedding space, thereby better preserving the semantic information of the molecular graph. A more essential and effective drug representation can be learned through this graph contrastive framework without additional supervised data. Next, we design a new loss function that can be directly used to adjust the uniformity of drug and target representations. By directly optimizing the uniformity of representations, the representation quality of drugs and targets can be improved. The effectiveness of the above innovative elements is verified on two real datasets, KIBA and Davis. Compared with the GraphDTA model, the relative improvement of the GraphCL-DTA model on the two datasets is 2.7% and 4.5%. The graph contrastive learning framework and uniformity function in the GraphCL-DTA model can be embedded into other computational models as independent modules to improve their generalization capability.
8 March 2023 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
The computational drug repositioning aims to discover new uses for marketed drugs, which can accelerate the drug development process and play an important role in the existing drug discovery system. However, the number of validated drug-disease associations is scarce compared to the number of drugs and diseases in the real world. Too few labeled samples will make the classification model unable to learn effective latent factors of drugs, resulting in poor generalization performance. In this work, we propose a multi-task self-supervised learning framework for computational drug repositioning. The framework tackles label sparsity by learning a better drug representation. Specifically, we take the drug-disease association prediction problem as the main task, and the auxiliary task is to use data augmentation strategies and contrast learning to mine the internal relationships of the original drug features, so as to automatically learn a better drug representation without supervised labels. And through joint training, it is ensured that the auxiliary task can improve the prediction accuracy of the main task. More precisely, the auxiliary task improves drug representation and serving as additional regularization to improve generalization. Furthermore, we design a multi-input decoding network to improve the reconstruction ability of the autoencoder model. We evaluate our model using three real-world datasets. The experimental results demonstrate the effectiveness of the multi-task self-supervised learning framework, and its predictive ability is superior to the state-of-the-art model.
21 January 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
The matrix factorization model has become the cornerstone technique for computational drug repositioning due to its ease of implementation and excellent scalability. However, the matrix factorization model uses the inner product operation to represent the association between drugs and diseases, which is lacking in expressive ability. Moreover, the degree of similarity of drugs or diseases could not be implied on their respective latent factor vectors, which is not satisfy the common sense of drug discovery. Therefore, a neural metric factorization model for computational drug repositioning (NMFDR) is proposed in this work. We novelly consider the latent factor vector of drugs and diseases as a point in the high-dimensional coordinate system and propose a generalized Euclidean distance to represent the association between drugs and diseases to compensate for the shortcomings of the inner product operation. Furthermore, by embedding multiple drug (disease) metrics information into the encoding space of the latent factor vector, the information about the similarity between drugs (diseases) can be reflected in the distance between latent factor vectors. Finally, we conduct wide analysis experiments on three real datasets to demonstrate the effectiveness of the above improvement points and the superiority of the NMFDR model.
5 October 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Computational drug repositioning technology is an effective tool to accelerate drug development. Although this technique has been widely used and successful in recent decades, many existing models still suffer from multiple drawbacks such as the massive number of unvalidated drug-disease associations and the inner product. The limitations of these works are mainly due to the following two reasons: firstly, previous works used negative sampling techniques to treat unvalidated drug-disease associations as negative samples, which is invalid in real-world settings; secondly, the inner product cannot fully take into account the feature information contained in the latent factor of drug and disease. In this paper, we propose a novel PUON framework for addressing the above deficiencies, which models the risk estimator of computational drug repositioning only using validated ( P ositive) and unvalidated ( U nlabelled) drug-disease associations without employing negative sampling techniques. The PUON also proposed an O uter N eighborhood-based classifier for modeling the cross-feature information of the latent facotor. For a comprehensive comparison, we considered 6 popular baselines. Extensive experiments in four real-world datasets showed that PUON model achieved the best performance based on 6 evaluation metrics.
4 September 2025 in IEEE Journal of Biomedical and Health Informatics
The personalization of cancer treatment through drug combinations is critical for improving healthcare outcomes, increasing effectiveness, and reducing side effects. Computational methods have become increasingly important to prioritize synergistic drug pairs because of the vast search space of possible chemicals. However, existing approaches typically rely solely on global molecular structures, neglecting information exchange between different modality representations and interactions between molecular and fine-grained fragments, leading to limited understanding of drug synergy mechanisms for personalized treatment. To address these limitations, we propose MOSAIC (Multi-granularity crOSs-modAl method for synergIstic drug combinations prediCtion), an AI-driven multi-granularity cross-modal method for personalized synergistic drug combination prediction that considers both molecular and fragment-level features. MOSAIC employs a dual-layer representation system, decomposing molecules into chemically meaningful fragments using the BRICS algorithm, facilitating information exchange between graph and SMILES representations through a bidirectional cross-attention mechanism, and ensuring semantic consistency of different modal representations of the same molecular fragment through a contrastive learning framework. Additionally, we designed a bilinear attention network to capture interactions between fragments of different drugs and dynamically integrate multi-granularity feature relationships through a multi-head attention mechanism. Through extensive experiments on multiple real-world datasets, MOSAIC demonstrates superior performance over state-of-the-art methods. Literature validation confirms its predicted novel drug combinations align with existing clinical evidence, while visualization analyses elucidate its capability to pinpoint key molecular fragments critical for drug synergy, providing valuable insights for personalized treatment planning and remote patient monitoring.
24 November 2025 in IEEE Transactions on Computational Biology and Bioinformatics
Computational drug repositioning technology can identify potential uses for existing drugs and reduce the time and cost required in the drug development process. How to find appropriate representations of drugs and diseases to predict the associations between the two is the main objective of such tasks. With the emergence of graph neural networks in recent years, researchers learned drugs and diseases via graphs in a bid to improve the prediction accuracy. However, there are three key problems that have not been adequately studied: 1) They usually place drug disease association graphs, drug-drug similarity graphs, and disease-disease similarity graphs under the same se mantic space for learning, which lose the higher-order features of the different graphs. 2) They assign equal weight to each neighbor node when aggregating based on the drug disease association graph, but the effect and mechanism of a drug in treating different diseases are not consistent. 3) They adopt residual connections to enhance the role of the root node without considering that this operation amplifies the effect of anomalous features. In view of this, we first propose a graph attention network-based spatial decomposition method for drug repositioning. Specifically, we reduce the dimensions of the feature space by spatial decomposition and initialize the drug and diseaseem bedding in the drug-similarity subspace, disease-similarity subspace, anddrug-disease association subspace, respectively. The representations of drugs and diseases are jointly captured in the corresponding subspace based on similarity and therapeutic associations. Moreover, the extent of the associations is measured through the graph attention mechanism to explore higher-order neighborhood relationships between drugs and diseases. Finally, we introduce a targeted residual connection for personalized propagation of node features. Experiments on four benchmark datasets show that our proposed architecture outperforms current state-of-the-art approaches. The code of this paper can be accessed at https://github.com/shaoqiezi/GATSD.