The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Predicting drug–target interactions from chemical and genomic kernels using Bayesian matrix factorization
Abstract
Motivation: Identifying interactions between drug compounds and target proteins has a great practical importance in the drug discovery process for known diseases. Existing databases contain very few experimentally validated drug–target interactions and formulating successful computational methods for predicting interactions remains challenging. Results: In this study, we consider four different drug–target interaction networks from humans involving enzymes, ion channels, G-protein-coupled receptors and nuclear receptors. We then propose a novel Bayesian formulation that combines dimensionality reduction, matrix factorization and binary classification for predicting drug–target interaction networks using only chemical similarity between drug compounds and genomic similarity between target proteins. The novelty of our approach comes from the joint Bayesian formulation of projecting drug compounds and target proteins into a unified subspace using the similarities and estimating the interaction network in that subspace. We propose using a variational approximation in order to obtain an efficient inference scheme and give its detailed derivations. Finally, we demonstrate the performance of our proposed method in three different scenarios: (i) exploratory data analysis using low-dimensional projections, (ii) predicting interactions for the out-of-sample drug compounds and (iii) predicting unknown interactions of the given network. Availability: Software and Supplementary Material are available at http://users.ics.aalto.fi/gonen/kbmf2k. Contact: mehmet.gonen@aalto.fi Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
KEGG for integration and interpretation of large-scale molecular data sets
Kanehisa, M., Goto, S., Sato, Y., Furumichi, M., & Tanabe, M. (2012) · Nucleic Acids Research · doi:10.1093/nar/gkr988 · Cited by 4,848
ChEMBL: a large-scale bioactivity database for drug discovery
Gaulton, A., Bellis, L. J., Bento, A. P., Chambers, J., Davies, M., Hersey, A., Light, Y., McGlinchey, S., Michalovich, D., Al-Lazikani, B., et al. (2012) · Nucleic Acids Research · doi:10.1093/nar/gkr777 · Cited by 4,382
Learning With Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Williams, C. K. I. (2003) · Journal of the American Statistical Association · doi:10.1198/jasa.2003.s269 · Cited by 4,281
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
Probabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · neural information processing systems · Cited by 3,798
Bayesian Analysis of Binary and Polychotomous Response Data
Albert, J. H., & Chib, S. (1993) · Journal of the American Statistical Association · doi:10.1080/01621459.1993.10476321 · Cited by 3,167
From genomics to chemical genomics: new developments in KEGG
Kanehisa, M. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj102 · Cited by 3,120
DrugBank: a knowledgebase for drugs, drug actions and drug targets
Wishart, D. S., Knox, C., Guo, A. C., Cheng, D., Shrivastava, S., Tzur, D., Gautam, B., & Hassanali, M. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkm958 · Cited by 2,861
A Fast Flexible Docking Method using an Incremental Construction Algorithm
Rarey, M., Kramer, B., Lengauer, T., & Klebe, G. (1996) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0477 · Cited by 2,827
Relating protein pharmacology by ligand chemistry
Keiser, M. J., Roth, B. L., Armbruster, B. N., Ernsberger, P., Irwin, J. J., & Shoichet, B. K. (2007) · Nature Biotechnology · doi:10.1038/nbt1284 · Cited by 2,402
Advances in Neural Information Processing Systems 18
Murray, I., Mackay, D., Zoubin Ghahramani, A., & Skilling, J. (2006) · Cited by 1,927
DrugBank 3.0: a comprehensive resource for 'Omics' research on drugs
Knox, C., Law, V., Jewison, T., Liu, P., Ly, S., Frolkis, A., Pon, A., Banco, K., Mak, C., Neveu, V., et al. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkq1126 · Cited by 1,831
Multiple Kernel Learning Algorithms
Gönen, M., & Alpaydın, E. (2011) · doi:10.5555/1953048.2021071 · Cited by 1,688
Self-citation(2003) · Cited by 1,680
Bayesian probabilistic matrix factorization using Markov chain Monte Carlo
Salakhutdinov, R., & Mnih, A. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390267 · Cited by 1,413
Prediction of drug–target interaction networks from the integration of chemical and genomic spaces
Yamanishi, Y., Araki, M., Gutteridge, A., Honda, W., & Kanehisa, M. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn162 · Cited by 1,147
Probabilistic Matrix Factorization
Salakhutdinov, R., & Mnih, A. (2007) · Cited by 1,075
Kernel Methods in Computational Biology
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/4057.001.0001 · Cited by 1,032
BRENDA, the enzyme database: updates and major new developments
Schomburg, I. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh081 · Cited by 953
Gaussian interaction profile kernels for predicting drug–target interaction
van Laarhoven, T., Nabuurs, S. B., & Marchiori, E. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr500 · Cited by 934
Gilks, W. R. (2005) · Encyclopedia of Biostatistics · doi:10.1002/0470011815.b2a14021 · Cited by 711
Structure-based maximal affinity model predicts small-molecule druggability
Cheng, A. C., Coleman, R. G., Smyth, K. T., Cao, Q., Soulard, P., Caffrey, D. R., Salzberg, A. C., & Huang, E. S. (2007) · Nature Biotechnology · doi:10.1038/nbt1273 · Cited by 695
SuperTarget and Matador: resources for exploring drug-target relationships
Gunther, S., Kuhn, M., Dunkel, M., Campillos, M., Senger, C., Petsalaki, E., Ahmed, J., Urdiales, E. G., Gewiess, A., Jensen, L. J., et al. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm862 · Cited by 647 · cited 2×
“Yamanishi et al. (2008) use KEGG BRITE (Kanehisa et al., 2006), BRENDA (Schomburg et al., 2004), SuperTarget (Günther et al., 2008) and DrugBank (Wishart et al., 2008) databases to collect information about the interactions between drug compounds and target proteins.”
MethodSupervised prediction of drug–target interactions using bipartite local models
Bleakley, K., & Yamanishi, Y. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp433 · Cited by 628
Byvatov, E., Fechner, U., Sadowski, J., & Schneider, G. (2003) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci0341161 · Cited by 565
Hattori, M., Okuno, Y., Goto, S., & Kanehisa, M. (2003) · Journal of the American Chemical Society · doi:10.1021/ja036030u · Cited by 484
Yamanishi, Y., Kotera, M., Kanehisa, M., & Goto, S. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq176 · Cited by 470
Protein-ligand interaction prediction: an improved chemogenomics approach
Jacob, L., & Vert, J.-P. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn409 · Cited by 378
Predicting ADME properties in silico: methods and models
Butina, D., Segall, M. D., & Frankcombe, K. (2002) · Drug Discovery Today · doi:10.1016/s1359-6446(02)02288-2 · Cited by 284
Learning with matrix factorizations
Srebro, N., & Jaakkola, T. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 224
SuperTarget goes quantitative: update on drug-target interactions
Hecker, N., Ahmed, J., von Eichborn, J., Dunkel, M., Macha, K., Eckert, A., Gilson, M. K., Bourne, P. E., & Preissner, R. (2012) · Nucleic Acids Research · doi:10.1093/nar/gkr912 · Cited by 213
Semi-supervised Learning via Gaussian Processes
Lawrence, N. D., & Jordan, M. I. (2004) · neural information processing systems · Cited by 147
A probabilistic model for mining implicit ‘chemical compound–gene’ relations from literature
Zhu, S., Okuno, Y., Tsujimoto, G., & Mamitsuka, H. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1141 · Cited by 108
Wassermann, A. M., Geppert, H., & Bajorath, J. (2009) · Journal of Chemical Information and Modeling · doi:10.1021/ci9002624 · Cited by 61
Cited by
DeepDTA: deep drug–target binding affinity prediction
Öztürk, H., Özgür, A., & Ozkirimli, E. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty593 · Cited by 1,696
A Survey on Distributed Machine Learning
Verbraeken, J., Wolting, M., Katzy, J., Kloppenburg, J., Verbelen, T., & Rellermeyer, J. S. (2021) · ACM Computing Surveys · doi:10.1145/3377454 · Cited by 872
Zitnik, M., Nguyen, F., Wang, B., Leskovec, J., Goldenberg, A., & Hoffman, M. M. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.09.012 · Cited by 675
Tsubaki, M., Tomii, K., & Sese, J. (2019) · Bioinformatics · doi:10.1093/bioinformatics/bty535 · Cited by 688
Tang, J., Szwajda, A., Shakyawar, S., Xu, T., Hintsanen, P., Wennerberg, K., & Aittokallio, T. (2014) · Journal of Chemical Information and Modeling · doi:10.1021/ci400709d · Cited by 645
Metadata
- Authors
- Gönen, M.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-06-23
- Volume
- 28
- Issue
- 18
- Pages
- 2304-2310
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2135007932
- Cited by
- 383
- References
- 38
- FWCI
- 14.59
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.