Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Biomedical Relation Extraction with Forest-Based Tagging Framework

Version 1 : Received: 27 November 2023 / Approved: 28 November 2023 / Online: 28 November 2023 (13:39:09 CET)

How to cite: Paul, K.; Lee, F.; Ali, W. Biomedical Relation Extraction with Forest-Based Tagging Framework. Preprints 2023, 2023111817. https://doi.org/10.20944/preprints202311.1817.v1 Paul, K.; Lee, F.; Ali, W. Biomedical Relation Extraction with Forest-Based Tagging Framework. Preprints 2023, 2023111817. https://doi.org/10.20944/preprints202311.1817.v1

Abstract

The groundbreaking Advanced Forest-Based Tagging Framework (AFTF) represents a paradigm shift in the domain of information extraction from medical texts. AFTF introduces a novel dual-binary tree structure that redefines how entity-relation triples are extracted. This innovative approach directly tackles the limitations of traditional linear and graph-based methods, effectively addressing challenges related to overlapping triples and computational efficiency. The AFTF model stands as a beacon of excellence, surpassing established baselines by significant margins in comprehensive evaluations on two pivotal medical datasets. Notably, AFTF achieves remarkable improvements in F1 scores, showcasing its prowess in accurate information extraction from complex medical narratives. Beyond its exceptional performance in the medical domain, AFTF exhibits remarkable versatility. This adaptability is vividly demonstrated through its robust performance across three diverse public datasets, further affirming its position as a versatile and reliable solution for information extraction tasks. This paper provides a comprehensive exposition of the AFTF architecture, shedding light on its innovative design principles and its efficient handling of intricate medical texts. AFTF represents a groundbreaking step forward in the realm of information extraction, promising enhanced accuracy, efficiency, and adaptability for a wide range of applications.

Keywords

Information extraction; Biomedical relation extraction; Dual-binary tree structure

Subject

Computer Science and Mathematics, Artificial Intelligence and Machine Learning

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.