about
Relationship extraction for knowledge graph creation from biomedical literature (arxiv.org)
1 point by walterbell on Jan 18, 2022 | hide | past | pdf | discuss on HN

In plain words: Hand-written rules, classic machine learning, and modern language models were compared for pulling biomedical relationships from papers to build knowledge graphs. Modern language models coped best with small, uneven training sets; the top one, trained on balanced data, hit an F1 score of 0.92.

Abstract · Comparison of biomedical relationship extraction methods and models for knowledge graph creation

Biomedical research is growing at such an exponential pace that scientists, researchers, and practitioners are no more able to cope with the amount of published literature in the domain. The knowledge presented in the literature needs to be systematized in such a way that claims and hypotheses can be easily found, accessed, and validated. Knowledge graphs can provide such a framework for semantic knowledge representation from literature. However, in order to build a knowledge graph, it is necessary to extract knowledge as relationships between biomedical entities and normalize both entities and relationship types. In this paper, we present and compare few rule-based and machine learning-based (Naive Bayes, Random Forests as examples of traditional machine learning methods and DistilBERT, PubMedBERT, T5 and SciFive-based models as examples of modern deep learning transformers) methods for scalable relationship extraction from biomedical literature, and for the integration into the knowledge graphs. We examine how resilient are these various methods to unbalanced and fairly small datasets. Our experiments show that transformer-based models handle well both small (due to pre-training on a large dataset) and unbalanced datasets. The best performing model was the PubMedBERT-based model fine-tuned on balanced data, with a reported F1-score of 0.92. DistilBERT-based model followed with F1-score of 0.89, performing faster and with lower resource requirements. BERT-based models performed better then T5-based generative models.

Nikola Milosevic, Wolfgang Thielemann
arXiv:2201.01647 · cs.AI, cs.CL, cs.IR, cs.LG · submitted Jan 5, 2022 · updated Aug 7, 2022
abstract · pdf · html · Paper submitted to Journal of Semantic Web

add comment on HN
Also discussed: Dec 2022 (2 points, 0 comments) · Dec 2022 (2 points, 0 comments) · Sep 2022 (1 point, 0 comments) · Apr 2022 (1 point, 0 comments) · Apr 2022 (6 points, 0 comments) · Feb 2022 (1 point, 0 comments) · Jan 2022 (3 points, 0 comments) · Jan 2022 (1 point, 0 comments)