EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Leveraging shortest dependency paths in low-resource biomedical relation extraction

Saman Enayati, Slobodan Vucetic

BMC Medical Informatics and Decision Making · 24.07.2024 · 24 (1)

DOI: 10.1186/s12911-024-02592-2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift BMC Medical Informatics and Decision Making, online erschienen am 24.07.2024. Verfasst von Saman Enayati und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer and Information Sciences, Temple University, 1925 N. 12th Street, Suite 304, Philadelphia, PA, 19122, USA. samanenayati@temple…. Hauptthemen laut MEDLINE: Natural Language Processing, Data Mining. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 41 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Background

Biomedical Relation Extraction (RE) is essential for uncovering complex relationships between biomedical entities within text. However, training RE classifiers is challenging in low-resource biomedical applications with few labeled examples.

Methods

We explore the potential of Shortest Dependency Paths (SDPs) to aid biomedical RE, especially in situations with limited labeled examples. In this study, we suggest various approaches to employ SDPs when creating word and sentence representations under supervised, semi-supervised, and in-context-learning settings.

Results

Through experiments on three benchmark biomedical text datasets, we find that incorporating SDP-based representations enhances the performance of RE classifiers. The improvement is especially notable when working with small amounts of labeled data.

Conclusion

SDPs offer valuable insights into the complex sentence structure found in many biomedical text passages. Our study introduces several straightforward techniques that, as demonstrated experimentally, effectively enhance the accuracy of RE classifiers.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Natural Language ProcessingData MiningHumansMachine Learning

Stichwörter der Autor:innen

BERTLow-resourceNatural language processingRelation extractionShortest dependency path

Autor:innen und Institutionen

  • Department of Computer and Information Sciences, Temple University, 1925 N. 12th Street, Suite 304, Philadelphia, PA, 19122, USA. samanenayati@temple.edu.
  • Department of Computer and Information Sciences, Temple University, 1925 N. 12th Street, Suite 304, Philadelphia, PA, 19122, USA.

Zitieren

APA

Enayati, S., & Vucetic, S. (2024). Leveraging shortest dependency paths in low-resource biomedical relation extraction. BMC Medical Informatics and Decision Making, 24(1). https://doi.org/10.1186/s12911-024-02592-2

Vancouver

Enayati S, Vucetic S. Leveraging shortest dependency paths in low-resource biomedical relation extraction. BMC Medical Informatics and Decision Making. 2024;24(1). doi:10.1186/s12911-024-02592-2

BibTeX
@article{Enayati2024,
  author = {Enayati, Saman and Vucetic, Slobodan},
  title = {Leveraging shortest dependency paths in low-resource biomedical relation extraction},
  journal = {BMC Medical Informatics and Decision Making},
  year = {2024},
  volume = {24},
  number = {1},
  doi = {10.1186/s12911-024-02592-2}
}
Kostenlos starten →