Cited by 36Computational Drug Discovery MethodsMachine Learning in BioinformaticsProtein Degradation and Inhibitors

Breaking the barriers of data scarcity in drug–target affinity prediction

Open access
Pei, Qizhi, Wu, Lijun, Zhu, Jinhua, Xia, Yingce, Xie, Shufang, Qin, Tao, Liu, Haiguang, Liu, Tie-Yan +1 more·2023·Briefings in Bioinformatics

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/bib/bbad386

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

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
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
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