Breaking the barriers of data scarcity in drug–target affinity prediction
Open accessAbstract
Accurate prediction of drug–target affinity (DTA) is of vital importance in early-stage drug discovery, facilitating the identification of drugs that can effectively interact with specific targets and regulate their activities. While wet experiments remain the most reliable method, they are time-consuming and resource-intensive, resulting in limited data availability that poses challenges for deep learning approaches. Existing methods have primarily focused on developing techniques based on the available DTA data, without adequately addressing the data scarcity issue. To overcome this challenge, we present the Semi-Supervised Multi-task training (SSM) framework for DTA prediction, which incorporates three simple yet highly effective strategies: (1) A multi-task training approach that combines DTA prediction with masked language modeling using paired drug–target data. (2) A semi-supervised training method that leverages large-scale unpaired molecules and proteins to enhance drug and target representations. This approach differs from previous methods that only employed molecules or proteins in pre-training. (3) The integration of a lightweight cross-attention module to improve the interaction between drugs and targets, further enhancing prediction accuracy. Through extensive experiments on benchmark datasets such as BindingDB, DAVIS and KIBA, we demonstrate the superior performance of our framework. Additionally, we conduct case studies on specific drug–target binding activities, virtual screening experiments, drug feature visualizations and real-world applications, all of which showcase the significant potential of our work. In conclusion, our proposed SSM-DTA framework addresses the data limitation challenge in DTA prediction and yields promising results, paving the way for more efficient and accurate drug discovery processes.
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
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.
Cites
Comprehensive analysis of kinase inhibitor selectivity
Davis, M. I., Hunt, J. P., Herrgard, S., Ciceri, P., Wodicka, L. M., Pallares, G., Hocker, M., Treiber, D. K., & Zarrinkar, P. P. (2011) · Nature Biotechnology · doi:10.1038/nbt.1990 · Cited by 2,409 · cited 2× · see citing works
“…the label range, the concentrations are transformed to logarithm scales: − log 10 ( x 10 9 ), where x is IC 50 or K i in the unit of nM. DAVIS [42] dataset contains selectivity assays of the kinase protein family and the relevant inhibitors with their respective dissociation constant ( K d )…”
BackgroundEvaluating Protein Transfer Learning with TAPE
Rao, R., Bhattacharya, N., Thomas, N., Duan, Y., Chen, X., Canny, J., Abbeel, P., & Song, Y. S. (2019) · doi:10.1101/676825 · Cited by 719 · see citing works
Unsupervised Pre-Training of Image Features on Non-Curated Data
Caron, M., Bojanowski, P., Mairal, J., & Joulin, A. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00305 · Cited by 258 · see citing works
Flagged first, then by citations
- Authors
- Pei, Q., Wu, L., Zhu, J., Xia, Y., Xie, S., Qin, T., Liu, H., Liu, T.-Y., & Yan, R.
- Affiliations
- Renmin University of China (CN)
- Microsoft (United States) (US)
- University of Science and Technology of China (CN)
- Corresponding author
- Wu, Lijun
- Yan, Rui
- Venue
- Briefings in Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2023-09-22
- Volume
- 24
- Issue
- 6
- ISSN
- 1467-5463 (ISSN-L)
- 1477-4054
- OpenAlex
- W4388035751
- Cited by
- 36
- References
- 3
- Citations by year
- 2026: 9 · 2025: 17 · 2024: 10
- FWCI
- 5.14
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Briefings in Bioinformatics (publishedVersion)
- PubMed (publishedVersion)
- Funders
- National Natural Science Foundation of China (62122089)
- Beijing Outstanding Young Scientist Program (BJJWZYJH012019100020098)
- Intelligent Social Governance Platform, Major Innovation & Planning Interdisciplinary Platform
- Renmin University of China
- Fundamental Research Funds for the Central Universities
- Research Funds of Renmin University of China
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Degradation and Inhibitors
- Keywords
- drug-target affinity prediction, data scarcity, semi-supervised learning, multi-task learning, masked language modeling, cross-attention, drug-target binding, virtual screening, early drug discovery
- MeSH terms
- Drug Delivery Systems, Drug Discovery
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