Biomedical Entity Normalization Using Encoder Regularization and Dynamic Ranking Mechanism

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Biomedical entity normalization is a fundamental method for lots of downstream applications. Due to the rich additional information for biomedical entities in medical dictionaries, such as synonyms or definitions, transformer-based models are applied to dig semantic representations in normalization recently. Despite the high performance of the transformer-based model, the over-fitting problem remains challenging and unsolved. Besides, bi-encoder structure and cross-encoder structure are popularly applied in many biomedical entity normalization works, the issue to measure the distance of such encoder structures is very challenging. Moreover, the triples margin ranking loss mechanism is widely used in reranking stage of entity normalization. In this paper, we proposed an encoder-level regularization to restrain the over-fitting problem caused by the deep representation of transformer. Moreover, we use a dynamic margin ranking mechanism instead of fixed margin selection in reranking stage during training. In this way, we experiment our model on three biomedical entity normalization datasets, and the empirical results outperform previous state-of-the-art models.

Cite

CITATION STYLE

APA

Chen, S., Xie, C., Wang, H., Ma, S., Liu, Y., Shi, Q., … Wang, H. (2023). Biomedical Entity Normalization Using Encoder Regularization and Dynamic Ranking Mechanism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14302 LNAI, pp. 498–510). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-44693-1_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free