skip to main content
10.1145/2350176.2350178acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Globalized bipartite local model for drug-target interaction prediction

Published:12 August 2012Publication History

ABSTRACT

In pharmacology, it is essential to identify the interactions between drug and targets to understand its effects. Supervised learning with Bipartite Local Model (BLM) recently has been shown to be effective for prediction of drug-target interactions by first predicting target proteins of a given known drug, then predicting drugs targeting a known protein. However, this pure "local" model is inapplicable to new drug or target candidates that currently have no known interactions. In this paper, we extend the existing BLM method by integrating a strategy for handling new drug and target candidates. Based on the assumption that similar drugs and targets have similar interaction profiles, we present a simple neighbor-based training data inferring procedure and integrate it into the frame work of BLM. This globalized BLM called bipartite local model with neighbor-based inferring (BLMN) then has an extended functionality for prediction interactions between new drug candidates and new target candidates. Good performance of BLMN has been observed in the experiment of predicting interactions between drugs and four important categories of targets. For the Nuclear Receptors dataset, where there are more chances for the presented strategy to be applied, 20% improvement in terms of AUPR was achieved. This demonstrates the effectiveness of BLMN and its potential in prediction of drug-target interactions.

References

  1. K. Bleakley and Y. Yamanishi. Supervised prediction of drug-target interactions using bipartite local models. Bioinformatics, 25(18):2397--2403, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Campillos et al. Drug target identification using side-effect similarity. Science, 321(5886):263--266, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  3. P. R. Caron et al. Chemogeominc approaches to drug discovery. Curr. Opin. Chem. Biol., 5:464--470, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  4. X. Chen et al. Drug-target interaction prediction by random walk on the heterogeneous network. Molecular BioSystems, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  5. J. Davis and M. Goadrich. The relationship between precision-recall and ROC curves. In Proc. 23rd International Conference on Machine Learning, pages 233--240, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Gnther et al. SuperTarget and Matador: resources for exploring drug-target relationships. Nucleic acids res., 36(Database issue):D919--D922, 2008.Google ScholarGoogle Scholar
  7. M. Hattori et al. Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways. J. Am. Chem Soc., 125(39):11853--11865, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  8. V. J. Haupt and M. Schroeder. Old friends in new guise: repositioning of known drugs with structural bioinformatics. Briefings in Bioinformatics, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  9. L. Jacob and J.-P. Vert. Protein-ligand interaction prediction: an improved chemogenomics approach. Bioinformatics, 24(19):2149--2156, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Kanehisa et al. From genomics to chemical genomics: new developments in KEGG. Nucleic acids res., 34(Database):D354--357, 2006.Google ScholarGoogle Scholar
  11. M. J. Keiser et al. Predicting new molecular targets for known drugs. Nature, 462:175--181, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  12. H. Kubinyi and G. Müller. Chemogenomics in Drug Discovery. Wiley-VCH, Weinheim, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  13. T. V. Laarhoven, S. B. Nabuurs, and E. Marchiori. Gaussian interaction profile kernels for predicting drug-target interaction. Bioinformatics, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Y. C. Martin et al. Do structurally similar molecules have similar biological activity? J. Med. Chem, 45:4350--4358, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  15. L. Perlman et al. Combining drug and gene similarity measures for drug-target elucidation. Journal of computational biology, 18:133--145, 2011.Google ScholarGoogle Scholar
  16. D. Rognan. Chemogenomic approaches to rational drug design. British Journal of Pharmacology, 152:38--52, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  17. I. Schomburg et al. BRENDA, the enzyme database: updates and major new developments. Nucleic Asids Res., 32(supl-1):D431--433, 2004.Google ScholarGoogle Scholar
  18. D. S. Wishart et al. DrugBank: a knowledgebase for drugs, drug actions and drug targets. Nucleic acids res., 36(Database issue):D901--906, 2008.Google ScholarGoogle Scholar
  19. Z. Xia et al. Semi-supervised drug-protein interaction prediction from heterogeneous biological spaces. BMC Systems Biology, 4 (Suppl 2):S6, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  20. Y. Yamanishi et al. Prediction of drug-target interaction networks from the integration of chemical and genomic spaces. Bioinformatics, 24:i232--i240, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Globalized bipartite local model for drug-target interaction prediction

      Recommendations

      Reviews

      You Chen

      The identification of drug-target interactions is very useful for understanding drug effects. In recent years, researchers have designed many models and systems to predict drug-target interactions. Among those models, the bipartite local model (BLM) is well known for its high accuracy of prediction. BLM treats drug-target interactions as a bipartite graph, with the two sides of the graph depicting drugs and targets respectively. BLM is a supervised learning model and does not resolve the important problem of predicting drug-target interactions for new drugs. The authors of this paper propose a new bipartite local model with neighbor-based inferring (BLMN). The significant difference between BLM and BLMN is that BLMN predicts drug-target interactions not only for existing drugs, but also for new drugs; this is shown in the first equation. For a new drug, BLMN first finds its nearest neighbors using pairwise similarity. It then predicts drug-target interactions for the new drug based on the drug-target interactions of its nearest neighbors. The inputs to BLMN are pairwise similarities for all drugs, pairwise similarities for all targets, and drug-target interactions for all drugs and targets. Pairwise similarities of drugs and targets are calculated through chem-seq, network-based, and hybrid inputs: "chem-seq denotes that chemical similarity is used for the drug and sequence similarity is used for the target; network-based denotes that the drug-drug similarity and target-target similarity are derived from the existing interaction network; [and] hybrid denotes that the drug-drug similarity and target-target similarity are combinations of the two types of similarities." A binary matrix A represents interactions between a set of drugs and a set of targets. If drug i has an interaction with target j , then the cell value of A ( i , j ) will be one. If drug i has no interaction with target j , then the value of A ( i , j ) will be zero. BLMN was evaluated on four different datasets: enzyme, ion channel, G protein coupled receptor (GPCR), and nuclear receptor. The experimental results indicate that BLMN has the highest scores for the area under the receiver operating characteristic (ROC) curve (AUC) and the area under the precision-recall curve (AUPR), based on hybrid similarity calculations for all four datasets. In addition, the authors compared BLM and BLMN on the nuclear receptor database with three different types of similarity: chem-seq, network-based, and hybrid. BLMN outperforms BLM for all three types of similarity. I did find three drawbacks to the paper. First, BLMN is a supervised learning method, which relies on a labeled training dataset. As we know, supervised learning methods perform better than semi-supervised and unsupervised methods, but they require many more resources. Second, in the third equation, there is a parameter ? to focus on the neighbors with the highest similarity; however, the experimental section neither provides a value for ? nor explains how different values of ? influence the model's performance. Third, the paper mostly relies on an earlier paper on BLM [1]. Without reading the BLM-related paper, readers cannot easily understand how BLMN works. Readers whose research interests are data mining and social analysis in bioinformatics are the paper's target audience. Online Computing Reviews Service

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        BIOKDD '12: Proceedings of the 11th International Workshop on Data Mining in Bioinformatics
        August 2012
        38 pages
        ISBN:9781450315524
        DOI:10.1145/2350176
        • General Chairs:
        • Jake Chen,
        • Mohammed J. Zaki,
        • Program Chairs:
        • Tamer Kahveci,
        • Saeed Salem,
        • Mehmet Koyutürk

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 12 August 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate7of16submissions,44%

        Upcoming Conference

        KDD '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader