Cited by 26Biomedical Text Mining and OntologiesComputational Drug Discovery MethodsRecommender Systems and Techniques

AGATHA: Automatic Graph Mining And Transformer based Hypothesis Generation Approach

Open access
Sybrandt, Justin, Tyagin, Ilya, Shtutman, Michael, Safro, Ilya·2020·Proceedings of the 29th ACM International Conference on Information & Knowledge Management

Abstract

Medical research is risky and expensive. Drug discovery requires researchers to efficiently winnow thousands of potential targets to a small candidate set. However, scientists spend significant time and money long before seeing the intermediate results that ultimately determine this smaller set. Hypothesis generation systems address this challenge by mining the wealth of publicly available scientific information to predict plausible research directions. We present AGATHA, a deep-learning hypothesis generation system that learns a data-driven ranking criteria to recommend new biomedical connections. We massively validate our system with a temporal holdout wherein we predict connections first introduced after 2015 using data published beforehand. We additionally explore biomedical sub-domains, and demonstrate AGATHA's predictive capacity across the twenty most popular relationship types. Furthermore, we perform an ablation study to examine the aspects of our semantic network that most contribute to recommendation quality. Overall, AGATHA achieves best-in-class recommendation quality when compared to other hypothesis generation systems built to predict across all available biomedical literature. Reproducibility: All code, experimental data, and pre-trained models are available online: sybrandt.com/2020/agatha.

Integrity signals

Registry

Crossref · 10.1145/3340531.3412684

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Sybrandt, J., Tyagin, I., Shtutman, M., & Safro, I.
Affiliations
  • Clemson University (US)
  • University of South Carolina (US)
Venue
Proceedings of the 29th ACM International Conference on Information & Knowledge Management
Publisher
ACM
Published
2020-10-19
Pages
2757-2764
ISSN
2155-0751 (ISSN-L)
OpenAlex
W3093787311
Cited by
26
References
2
Citations by year
2026: 1 · 2025: 4 · 2024: 12 · 2023: 1 · 2022: 5 · 2021: 2 · 2020: 1
FWCI
6.50
Type
conference paper
Language
en
Open access
Locations
  • ACM International Conference on Information and Knowledge Management (CIKM) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
NSF (1633608)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Biomedical Text Mining and Ontologies
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
Keywords
hypothesis generation, biomedical text mining, drug target prioritization, deep learning, semantic networks, Agatha

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