Exploiting Graph Embeddings from Knowledge Bases for Neural Biomedical Relation Extraction
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 14762 LNCS, Page: 409-422
2024
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Conference Paper Description
Integrating external knowledge into neural models has been extensively studied to improve the performance of pre-trained language models, especially in the biomedical domain. In this paper, we explore the contribution of graph embeddings to relation extraction (RE) tasks. Given a pair of candidate entity mentions in a text, we hypothesize that the relations between them in an external knowledge base (KB) help predict whether a relation exists in the text, even if the KB relations are different from those of the RE task. Our approach consists of computing KB graph embeddings and estimating the plausibility that a KB relation exists between the candidate entities to better predict the target relation in the text. Experiments conducted on three biomedical RE tasks show that our method outperforms the baseline model PubMedBERT and achieves comparable performance to state-of-the-art methods. Our code is available at https://github.com/Bibliome/KBPubMedBERT.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85205354892&origin=inward; http://dx.doi.org/10.1007/978-3-031-70239-6_28; https://link.springer.com/10.1007/978-3-031-70239-6_28; https://dx.doi.org/10.1007/978-3-031-70239-6_28; https://link.springer.com/chapter/10.1007/978-3-031-70239-6_28
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know