Cargando…

List-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders

Biomedical question answering (QA) represents a growing concern among industry and academia due to the crucial impact of biomedical information. When mapping and ranking candidate snippet answers within relevant literature, current QA systems typically refer to information retrieval (IR) techniques:...

Descripción completa

Detalles Bibliográficos
Autores principales: Yan, Yan, Zhang, Bo-Wen, Li, Xu-Feng, Liu, Zhenhan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7652278/
https://www.ncbi.nlm.nih.gov/pubmed/33166367
http://dx.doi.org/10.1371/journal.pone.0242061
_version_ 1783607678317101056
author Yan, Yan
Zhang, Bo-Wen
Li, Xu-Feng
Liu, Zhenhan
author_facet Yan, Yan
Zhang, Bo-Wen
Li, Xu-Feng
Liu, Zhenhan
author_sort Yan, Yan
collection PubMed
description Biomedical question answering (QA) represents a growing concern among industry and academia due to the crucial impact of biomedical information. When mapping and ranking candidate snippet answers within relevant literature, current QA systems typically refer to information retrieval (IR) techniques: specifically, query processing approaches and ranking models. However, these IR-based approaches are insufficient to consider both syntactic and semantic relatedness and thus cannot formulate accurate natural language answers. Recently, deep learning approaches have become well-known for learning optimal semantic feature representations in natural language processing tasks. In this paper, we present a deep ranking recursive autoencoders (rankingRAE) architecture for ranking question-candidate snippet answer pairs (Q-S) to obtain the most relevant candidate answers for biomedical questions extracted from the potentially relevant documents. In particular, we convert the task of ranking candidate answers to several simultaneous binary classification tasks for determining whether a question and a candidate answer are relevant. The compositional words and their random initialized vectors of concatenated Q-S pairs are fed into recursive autoencoders to learn the optimal semantic representations in an unsupervised way, and their semantic relatedness is classified through supervised learning. Unlike several existing methods to directly choose the top-K candidates with highest probabilities, we take the influence of different ranking results into consideration. Consequently, we define a listwise “ranking error” for loss function computation to penalize inappropriate answer ranking for each question and to eliminate their influence. The proposed architecture is evaluated with respect to the BioASQ 2013-2018 Six-year Biomedical Question Answering benchmarks. Compared with classical IR models, other deep representation models, as well as some state-of-the-art systems for these tasks, the experimental results demonstrate the robustness and effectiveness of rankingRAE.
format Online
Article
Text
id pubmed-7652278
institution National Center for Biotechnology Information
language English
publishDate 2020
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-76522782020-11-18 List-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders Yan, Yan Zhang, Bo-Wen Li, Xu-Feng Liu, Zhenhan PLoS One Research Article Biomedical question answering (QA) represents a growing concern among industry and academia due to the crucial impact of biomedical information. When mapping and ranking candidate snippet answers within relevant literature, current QA systems typically refer to information retrieval (IR) techniques: specifically, query processing approaches and ranking models. However, these IR-based approaches are insufficient to consider both syntactic and semantic relatedness and thus cannot formulate accurate natural language answers. Recently, deep learning approaches have become well-known for learning optimal semantic feature representations in natural language processing tasks. In this paper, we present a deep ranking recursive autoencoders (rankingRAE) architecture for ranking question-candidate snippet answer pairs (Q-S) to obtain the most relevant candidate answers for biomedical questions extracted from the potentially relevant documents. In particular, we convert the task of ranking candidate answers to several simultaneous binary classification tasks for determining whether a question and a candidate answer are relevant. The compositional words and their random initialized vectors of concatenated Q-S pairs are fed into recursive autoencoders to learn the optimal semantic representations in an unsupervised way, and their semantic relatedness is classified through supervised learning. Unlike several existing methods to directly choose the top-K candidates with highest probabilities, we take the influence of different ranking results into consideration. Consequently, we define a listwise “ranking error” for loss function computation to penalize inappropriate answer ranking for each question and to eliminate their influence. The proposed architecture is evaluated with respect to the BioASQ 2013-2018 Six-year Biomedical Question Answering benchmarks. Compared with classical IR models, other deep representation models, as well as some state-of-the-art systems for these tasks, the experimental results demonstrate the robustness and effectiveness of rankingRAE. Public Library of Science 2020-11-09 /pmc/articles/PMC7652278/ /pubmed/33166367 http://dx.doi.org/10.1371/journal.pone.0242061 Text en © 2020 Yan et al http://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
spellingShingle Research Article
Yan, Yan
Zhang, Bo-Wen
Li, Xu-Feng
Liu, Zhenhan
List-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders
title List-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders
title_full List-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders
title_fullStr List-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders
title_full_unstemmed List-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders
title_short List-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders
title_sort list-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7652278/
https://www.ncbi.nlm.nih.gov/pubmed/33166367
http://dx.doi.org/10.1371/journal.pone.0242061
work_keys_str_mv AT yanyan listwiselearningtorankbiomedicalquestionanswerpairswithdeeprankingrecursiveautoencoders
AT zhangbowen listwiselearningtorankbiomedicalquestionanswerpairswithdeeprankingrecursiveautoencoders
AT lixufeng listwiselearningtorankbiomedicalquestionanswerpairswithdeeprankingrecursiveautoencoders
AT liuzhenhan listwiselearningtorankbiomedicalquestionanswerpairswithdeeprankingrecursiveautoencoders