The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Collaborative matrix factorization with multiple similarities for predicting drug-target interactions
Abstract
We address the problem of predicting new drug-target interactions from three inputs: known interactions, similarities over drugs and those over targets. This setting has been considered by many methods, which however have a common problem of allowing to have only one similarity matrix over drugs and that over targets. The key idea of our approach is to use more than one similarity matrices over drugs as well as those over targets, where weights over the multiple similarity matrices are estimated from data to automatically select similarities, which are effective for improving the performance of predicting drug-target interactions. We propose a factor model, named Multiple Similarities Collaborative Matrix Factorization(MSCMF), which projects drugs and targets into a common low-rank feature space, which is further consistent with weighted similarity matrices over drugs and those over targets. These two low-rank matrices and weights over similarity matrices are estimated by an alternating least squares algorithm. Our approach allows to predict drug-target interactions by the two low-rank matrices collaboratively and to detect similarities which are important for predicting drug-target interactions. This approach is general and applicable to any binary relations with similarities over elements, being found in many applications, such as recommender systems. In fact, MSCMF is an extension of weighted low-rank approximation for one-class collaborative filtering. We extensively evaluated the performance of MSCMF by using both synthetic and real datasets. Experimental results showed nice properties of MSCMF on selecting similarities useful in improving the predictive performance and the performance advantage of MSCMF over six state-of-the-art methods for predicting drug-target interactions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Gene Ontology: tool for the unification of biology
Ashburner, M., Ball, C. A., Blake, J. A., Botstein, D., Butler, H., Cherry, J. M., Davis, A. P., Dolinski, K., Dwight, S. S., Eppig, J. T., et al. (2000) · Nature Genetics · doi:10.1038/75556 · Cited by 43,206
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Database resources of the National Center for Biotechnology Information: update
Wheeler, D. L. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh073 · Cited by 10,641
The relationship between Precision-Recall and ROC curves
Davis, J., & Goadrich, M. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143874 · Cited by 6,559
Probabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · UCL Discovery (University College London) · Cited by 4,517
BioGRID: a general repository for interaction datasets
Stark, C. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj109 · Cited by 3,960 · cited 1×
“Protein-protein interaction (PPI) network similarity (PPI) is computed from the shortest distance between two targets in a human protein-protein interaction (PPI) network [25].”
BackgroundAn Information-Theoretic Definition of Similarity
Lin, D. (1998) · International Conference on Machine Learning · Cited by 3,790
SoRec: social recommendation using probabilistic matrix factorization
Ma, H., Yang, H., Lyu, M. R., & King, I. (2008) · Proceedings of the 17th ACM conference on Information and knowledge management · doi:10.1145/1458082.1458205 · Cited by 1,401
GOSemSim: an R package for measuring semantic similarity among GO terms and gene products
Yu, G., Li, F., Qin, Y., Bo, X., Wu, Y., & Wang, S. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq064 · Cited by 1,388
Convex and Semi-Nonnegative Matrix Factorizations
Ding, C. H. Q., Li, T., & Jordan, M. I. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.277 · Cited by 1,317
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
One-Class Collaborative Filtering
Pan, R., Zhou, Y., Cao, B., Liu, N. N., Lukose, R., Scholz, M., & Yang, Q. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.16 · Cited by 1,015
Dobson, C. M. (2004) · Nature · doi:10.1038/nature03192 · Cited by 1,003
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
Weighted low-rank approximations
Srebro, N., & Jaakkola, T. (2003) · International Conference on Machine Learning · Cited by 715
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
Supervised prediction of drug–target interactions using bipartite local models
Bleakley, K., & Yamanishi, Y. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp433 · Cited by 628
Generalized Nonnegative Matrix Approximations with Bregman Divergences
Sra, S., & Dhillon, I. S. (2005) · MPG.PuRe (Max Planck Society) · Cited by 523
Generalized Low Rank Approximations of Matrices
Ye, J. (2005) · Machine Learning · doi:10.1007/s10994-005-3561-6 · Cited by 428
Semi-supervised drug-protein interaction prediction from heterogeneous biological spaces
Xia, Z., Wu, L.-Y., Zhou, X., & Wong, S. T. (2010) · BMC Systems Biology · doi:10.1186/1752-0509-4-s2-s6 · Cited by 389
Gönen, M. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts360 · Cited by 383
Protein-ligand interaction prediction: an improved chemogenomics approach
Jacob, L., & Vert, J.-P. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn409 · Cited by 378
Gu, Q., Zhou, J., & Ding, C. (2010) · Proceedings of the 2010 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.18 · Cited by 235
Hopkins, A. L. (2009) · Nature · doi:10.1038/462167a · Cited by 176
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
Pan, R., & Scholz, M. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557094 · Cited by 162
Chemogenomic approaches to drug discovery: similar receptors bind similar ligands
Klabunde, T. (2007) · British Journal of Pharmacology · doi:10.1038/sj.bjp.0707308 · Cited by 155
Improving one-class collaborative filtering by incorporating rich user information
Li, Y., Hu, J., Zhai, C., & Chen, Y. (2010) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1871437.1871559 · Cited by 136
Iskar, M., Zeller, G., Zhao, X., van Noort, V., & Bork, P. (2011) · Current Opinion in Biotechnology · doi:10.1016/j.copbio.2011.11.010 · Cited by 123
Generalized Nonnegative Matrix Approximations with Bregman Divergences
Dhillon, I. S., & Sra, S. (2005) · Cited by 123
Nagamine, N., & Sakakibara, Y. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm266 · Cited by 118
Škrbo, A., Begović, B., & Škrbo, S. (2004) · PubMed · Cited by 76
Cited by
Luo, Y., Zhao, X., Zhou, J., Yang, J., Zhang, Y., Kuang, W., Peng, J., Chen, L., & Zeng, J. (2017) · Nature Communications · doi:10.1038/s41467-017-00680-8 · Cited by 916
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
Lee, I., Keum, J., & Nam, H. (2019) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1007129 · Cited by 675
MolTrans: Molecular Interaction Transformer for drug–target interaction prediction
Huang, K., Xiao, C., Glass, L. M., & Sun, J. (2021) · Bioinformatics · doi:10.1093/bioinformatics/btaa880 · Cited by 653
Rifaioglu, A. S., Atas, H., Martin, M. J., Cetin-Atalay, R., Atalay, V., & Doğan, T. (2019) · Briefings in Bioinformatics · doi:10.1093/bib/bby061 · Cited by 529
Metadata
- Authors
- Zheng, X., Ding, H., Mamitsuka, H., & Zhu, S.
- Venue
- Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2013-08-11
- Pages
- 1025-1033
- OpenAlex
- W2029348196
- Cited by
- 328
- References
- 32
- FWCI
- 7.07
- Type
- conference paper
- 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.