Synthesize heterogeneous biological knowledge via representation learning for Alzheimer's disease drug repurposing.
Ontology highlight
ABSTRACT:
SUBMITTER: Hsieh KL
PROVIDER: S-EPMC9804117 | biostudies-literature | 2023 Jan
REPOSITORIES: biostudies-literature
Publications
Synthesize heterogeneous biological knowledge via representation learning for Alzheimer's disease drug repurposing.
Hsieh Kang-Lin KL Plascencia-Villa German G Lin Ko-Hong KH Perry George G Jiang Xiaoqian X Kim Yejin Y
iScience 20221126 1
Developing drugs for treating Alzheimer's disease has been extremely challenging and costly due to limited knowledge of underlying mechanisms and therapeutic targets. To address the challenge in AD drug development, we developed a multi-task deep learning pipeline that learns biological interactions and AD risk genes, then utilizes multi-level evidence on drug efficacy to identify repurposable drug candidates. Using the embedding derived from the model, we ranked drug candidates based on evidenc ...[more]
Similar Datasets
Project description:Clinical trials of novel therapeutics for Alzheimer's Disease (AD) have consumed a large amount of time and resources with largely negative results. Repurposing drugs already approved by the Food and Drug Administration (FDA) for another indication is a more rapid and less expensive option. In this study, we profile 80 FDA-approved and clinically tested drugs in neural cell cultures, with the goal of producing a ranked list of possible repurposing candidates.
2021-01-14 | GSE164788 | GEO
Project description:MotivationBiological data and knowledge bases increasingly rely on Semantic Web technologies and the use of knowledge graphs for data integration, retrieval and federated queries. In the past years, feature learning methods that are applicable to graph-structured data are becoming available, but have not yet widely been applied and evaluated on structured biological knowledge. Results: We develop a novel method for feature learning on biological knowledge graphs. Our method combines symbolic methods, in particular knowledge representation using symbolic logic and automated reasoning, with neural networks to generate embeddings of nodes that encode for related information within knowledge graphs. Through the use of symbolic logic, these embeddings contain both explicit and implicit information. We apply these embeddings to the prediction of edges in the knowledge graph representing problems of function prediction, finding candidate genes of diseases, protein-protein interactions, or drug target relations, and demonstrate performance that matches and sometimes outperforms traditional approaches based on manually crafted features. Our method can be applied to any biological knowledge graph, and will thereby open up the increasing amount of Semantic Web based knowledge bases in biology to use in machine learning and data analytics.Availability and implementationhttps://github.com/bio-ontology-research-group/walking-rdf-and-owl.Contactrobert.hoehndorf@kaust.edu.sa.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC5860058 | biostudies-literature
Project description:MotivationThe task of predicting drug-target interactions (DTIs) plays a significant role in facilitating the development of novel drug discovery. Compared with laboratory-based approaches, computational methods proposed for DTI prediction are preferred due to their high-efficiency and low-cost advantages. Recently, much attention has been attracted to apply different graph neural network (GNN) models to discover underlying DTIs from heterogeneous biological information network (HBIN). Although GNN-based prediction methods achieve better performance, they are prone to encounter the over-smoothing simulation when learning the latent representations of drugs and targets with their rich neighborhood information in HBIN, and thereby reduce the discriminative ability in DTI prediction.ResultsIn this work, an improved graph representation learning method, namely iGRLDTI, is proposed to address the above issue by better capturing more discriminative representations of drugs and targets in a latent feature space. Specifically, iGRLDTI first constructs an HBIN by integrating the biological knowledge of drugs and targets with their interactions. After that, it adopts a node-dependent local smoothing strategy to adaptively decide the propagation depth of each biomolecule in HBIN, thus significantly alleviating over-smoothing by enhancing the discriminative ability of feature representations of drugs and targets. Finally, a Gradient Boosting Decision Tree classifier is used by iGRLDTI to predict novel DTIs. Experimental results demonstrate that iGRLDTI yields better performance that several state-of-the-art computational methods on the benchmark dataset. Besides, our case study indicates that iGRLDTI can successfully identify novel DTIs with more distinguishable features of drugs and targets.Availability and implementationPython codes and dataset are available at https://github.com/stevejobws/iGRLDTI/.
| S-EPMC10397422 | biostudies-literature
Project description:ObjectiveTo discover candidate drugs to repurpose for COVID-19 using literature-derived knowledge and knowledge graph completion methods.MethodsWe propose a novel, integrative, and neural network-based literature-based discovery (LBD) approach to identify drug candidates from PubMed and other COVID-19-focused research literature. Our approach relies on semantic triples extracted using SemRep (via SemMedDB). We identified an informative and accurate subset of semantic triples using filtering rules and an accuracy classifier developed on a BERT variant. We used this subset to construct a knowledge graph, and applied five state-of-the-art, neural knowledge graph completion algorithms (i.e., TransE, RotatE, DistMult, ComplEx, and STELP) to predict drug repurposing candidates. The models were trained and assessed using a time slicing approach and the predicted drugs were compared with a list of drugs reported in the literature and evaluated in clinical trials. These models were complemented by a discovery pattern-based approach.ResultsAccuracy classifier based on PubMedBERT achieved the best performance (F1 = 0.854) in identifying accurate semantic predications. Among five knowledge graph completion models, TransE outperformed others (MR = 0.923, Hits@1 = 0.417). Some known drugs linked to COVID-19 in the literature were identified, as well as others that have not yet been studied. Discovery patterns enabled identification of additional candidate drugs and generation of plausible hypotheses regarding the links between the candidate drugs and COVID-19. Among them, five highly ranked and novel drugs (i.e., paclitaxel, SB 203580, alpha 2-antiplasmin, metoclopramide, and oxymatrine) and the mechanistic explanations for their potential use are further discussed.ConclusionWe showed that a LBD approach can be feasible not only for discovering drug candidates for COVID-19, but also for generating mechanistic explanations. Our approach can be generalized to other diseases as well as to other clinical questions. Source code and data are available at https://github.com/kilicogluh/lbd-covid.
| S-EPMC7869625 | biostudies-literature
Project description:Drug repurposing aims to find new therapeutic applications for existing drugs in the pharmaceutical market, leading to significant savings in time and cost. The use of artificial intelligence and knowledge graphs to propose repurposing candidates facilitates the process, as large amounts of data can be processed. However, it is important to pay attention to the explainability needed to validate the predictions. We propose a general architecture to understand several explainable methods for graph completion based on knowledge graphs and design our own architecture for drug repurposing. We present XG4Repo (eXplainable Graphs for Repurposing), a framework that takes advantage of the connectivity of any biomedical knowledge graph to link compounds to the diseases they can treat. Our method allows methapaths of different types and lengths, which are automatically generated and optimised based on data. XG4Repo focuses on providing meaningful explanations to the predictions, which are based on paths from compounds to diseases. These paths include nodes such as genes, pathways, side effects, or anatomies, so they provide information about the targets and other characteristics of the biomedical mechanism that link compounds and diseases. Paths make predictions interpretable for experts who can validate them and use them in further research on drug repurposing. We also describe three use cases where we analyse new uses for Epirubicin, Paclitaxel, and Predinisone and present the paths that support the predictions.
| S-EPMC11258358 | biostudies-literature
Project description:Clinical trials of novel therapeutics for Alzheimer's Disease (AD) have consumed a large amount of time and resources with largely negative results. Repurposing drugs already approved by the Food and Drug Administration (FDA) for another indication is a more rapid and less expensive option. We present DRIAD (Drug Repurposing In AD), a machine learning framework that quantifies potential associations between the pathology of AD severity (the Braak stage) and molecular mechanisms as encoded in lists of gene names. DRIAD is applied to lists of genes arising from perturbations in differentiated human neural cell cultures by 80 FDA-approved and clinically tested drugs, producing a ranked list of possible repurposing candidates. Top-scoring drugs are inspected for common trends among their targets. We propose that the DRIAD method can be used to nominate drugs that, after additional validation and identification of relevant pharmacodynamic biomarker(s), could be readily evaluated in a clinical trial.
| S-EPMC7884393 | biostudies-literature
Project description:Background It often takes more than 10 years and costs more than 1 billion dollars to develop a new drug for a particular disease and bring it to the market. Drug repositioning can significantly reduce costs and time in drug development. Recently, computational drug repositioning attracted a considerable amount of attention among researchers, and a plethora of computational drug repositioning methods have been proposed. This methodology has widely been used in order to address various medical challenges, including cancer treatment. The most common cancers are lung and breast cancers. Thus, suggesting FDA-approved drugs via drug repositioning for breast cancer would help us to circumvent the approval process and subsequently save money as well as time. Methods In this study, we propose a novel network-based method, named RepCOOL, for drug repositioning. RepCOOL integrates various heterogeneous biological networks to suggest new drug candidates for a given disease. Results The proposed method showed a promising performance on benchmark datasets via rigorous cross-validation. The final drug repositioning model has been built based on a random forest classifier after examining various machine learning algorithms. Finally, in a case study, four FDA approved drugs were suggested for breast cancer stage II. Conclusion Results show the potency of the proposed method in detecting true drug-disease relationships. RepCOOL suggested four new drugs for breast cancer stage II namely Doxorubicin, Paclitaxel, Trastuzumab, and Tamoxifen.
| S-EPMC7532104 | biostudies-literature
Project description:BackgroundThe traditional process of developing new drugs is time-consuming and often unsuccessful, making drug repurposing an appealing alternative due to its speed and safety. Graph neural networks (GCNs) have emerged as a leading approach for predicting drug-disease associations by integrating drug and disease-related networks with advanced deep learning algorithms. However, GCNs generally infer association probabilities only for existing drugs and diseases, requiring network re-establishment and retraining for novel entities. Additionally, these methods often struggle with sparse networks and fail to elucidate the biological mechanisms underlying newly predicted drugs.MethodsTo address the limitations of traditional methods, we developed HEDDI-Net, a heterogeneous embedding architecture designed to accurately detect drug-disease associations while preserving the interpretability of biological mechanisms. HEDDI-Net integrates graph and shallow learning techniques to extract representative diseases and proteins, respectively. These representative diseases and proteins are used to embed the input features, which are then utilized in a multilayer perceptron for predicting drug-disease associations.ResultsIn experiments, HEDDI-Net achieves areas under the receiver operating characteristic curve of over 0.98, outperforming state-of-the-art methods. Rigorous recovery analyses reveal a median recovery rate of 73% for the top 100 diseases, demonstrating its efficacy in identifying novel target diseases for existing drugs, known as drug repurposing. A case study on Alzheimer's disease highlighted the model's practical applicability and interpretability, identifying potential drug candidates like Baclofen, Fluoxetine, Pentoxifylline and Phenytoin. Notably, over 40% of the predicted candidates in the clusters of commonly prescribed clinical drugs Donepezil and Galantamine had been tested in clinical trials, validating the model's predictive accuracy and practical relevance.ConclusionsHEDDI-NET represents a significant advancement by allowing direct application to new diseases and drugs without the need for retraining, a limitation of most GCN-based methods. Furthermore, HEDDI-Net provides detailed affinity patterns with representative proteins for predicted candidate drugs, facilitating an understanding of their physiological effects. This capability also supports the design and testing of alternative drugs that are similar to existing medications, enhancing the reliability and interpretability of potential repurposed drugs. The case study on Alzheimer's disease further underscores HEDDI-Net's ability to predict promising drugs and its applicability in drug repurposing.
| S-EPMC11786366 | biostudies-literature
Project description:BackgroundIn Literature-based Discovery (LBD), Swanson's original ABC model brought together isolated public knowledge statements and assembled them to infer putative hypotheses via logical connections. Modern LBD studies that scale up this approach through automation typically rely on a simple entity-based knowledge graph with co-occurrences and/or semantic triples as basic building blocks. However, our analysis of a knowledge graph constructed for a recent LBD system reveals limitations arising from such pairwise representations, which further negatively impact knowledge inference. Using LBD as the context and motivation in this work, we explore limitations of using pairwise relationships only as knowledge representation in knowledge graphs, and we identify impacts of these limitations on knowledge inference. We argue that enhanced knowledge representation is beneficial for biological knowledge representation in general, as well as for both the quality and the specificity of hypotheses proposed with LBD.ResultsBased on a systematic analysis of one co-occurrence-based LBD system focusing on Alzheimer's Disease, we identify 7 types of limitations arising from the exclusive use of pairwise relationships in a standard knowledge graph-including the need to capture more than two entities interacting together in a single event-and 3 types of negative impacts on knowledge inferred with the graph-Experimentally infeasible hypotheses, Literature-inconsistent hypotheses, and Oversimplified hypotheses explanations. We also present an indicative distribution of different types of relationships. Pairwise relationships are an essential component in representation frameworks for knowledge discovery. However, only 20% of discoveries are perfectly represented with pairwise relationships alone. 73% require a combination of pairwise relationships and nested relationships. The remaining 7% are represented with pairwise relationships, nested relationships, and hypergraphs.ConclusionWe argue that the standard entity pair-based knowledge graph, while essential for representing basic binary relations, results in important limitations for comprehensive biological knowledge representation and impacts downstream tasks such as proposing meaningful discoveries in LBD. These limitations can be mitigated by integrating more semantically complex knowledge representation strategies, including capturing collective interactions and allowing for nested entities. The use of more sophisticated knowledge representation will benefit biological fields with more expressive knowledge graphs. Downstream tasks, such as LBD, can benefit from richer representations as well, allowing for generation of implicit knowledge discoveries and explanations for disease diagnosis, treatment, and mechanism that are more biologically meaningful.
| S-EPMC11924609 | biostudies-literature
Project description:MotivationDrug repurposing is a viable solution for reducing the time and cost associated with drug development. However, thus far, the proposed drug repurposing approaches still need to meet expectations. Therefore, it is crucial to offer a systematic approach for drug repurposing to achieve cost savings and enhance human lives. In recent years, using biological network-based methods for drug repurposing has generated promising results. Nevertheless, these methods have limitations. Primarily, the scope of these methods is generally limited concerning the size and variety of data they can effectively handle. Another issue arises from the treatment of heterogeneous data, which needs to be addressed or converted into homogeneous data, leading to a loss of information. A significant drawback is that most of these approaches lack end-to-end functionality, necessitating manual implementation and expert knowledge in certain stages.ResultsWe propose a new solution, Heterogeneous Graph Transformer for Drug Repurposing (HGTDR), to address the challenges associated with drug repurposing. HGTDR is a three-step approach for knowledge graph-based drug repurposing: (1) constructing a heterogeneous knowledge graph, (2) utilizing a heterogeneous graph transformer network, and (3) computing relationship scores using a fully connected network. By leveraging HGTDR, users gain the ability to manipulate input graphs, extract information from diverse entities, and obtain their desired output. In the evaluation step, we demonstrate that HGTDR performs comparably to previous methods. Furthermore, we review medical studies to validate our method's top 10 drug repurposing suggestions, which have exhibited promising results. We also demonstrated HGTDR's capability to predict other types of relations through numerical and experimental validation, such as drug-protein and disease-protein inter-relations.Availability and implementationThe source code and data are available at https://github.com/bcb-sut/HGTDR and http://git.dml.ir/BCB/HGTDR.
| S-EPMC11223801 | biostudies-literature