Cargando…

MeSH Now: automatic MeSH indexing at PubMed scale via learning to rank

BACKGROUND: MeSH indexing is the task of assigning relevant MeSH terms based on a manual reading of scholarly publications by human indexers. The task is highly important for improving literature retrieval and many other scientific investigations in biomedical research. Unfortunately, given its manu...

Descripción completa

Detalles Bibliográficos
Autores principales: Mao, Yuqing, Lu, Zhiyong
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5392968/
https://www.ncbi.nlm.nih.gov/pubmed/28412964
http://dx.doi.org/10.1186/s13326-017-0123-3
_version_ 1783229503055593472
author Mao, Yuqing
Lu, Zhiyong
author_facet Mao, Yuqing
Lu, Zhiyong
author_sort Mao, Yuqing
collection PubMed
description BACKGROUND: MeSH indexing is the task of assigning relevant MeSH terms based on a manual reading of scholarly publications by human indexers. The task is highly important for improving literature retrieval and many other scientific investigations in biomedical research. Unfortunately, given its manual nature, the process of MeSH indexing is both time-consuming (new articles are not immediately indexed until 2 or 3 months later) and costly (approximately ten dollars per article). In response, automatic indexing by computers has been previously proposed and attempted but remains challenging. In order to advance the state of the art in automatic MeSH indexing, a community-wide shared task called BioASQ was recently organized. METHODS: We propose MeSH Now, an integrated approach that first uses multiple strategies to generate a combined list of candidate MeSH terms for a target article. Through a novel learning-to-rank framework, MeSH Now then ranks the list of candidate terms based on their relevance to the target article. Finally, MeSH Now selects the highest-ranked MeSH terms via a post-processing module. RESULTS: We assessed MeSH Now on two separate benchmarking datasets using traditional precision, recall and F(1)-score metrics. In both evaluations, MeSH Now consistently achieved over 0.60 in F-score, ranging from 0.610 to 0.612. Furthermore, additional experiments show that MeSH Now can be optimized by parallel computing in order to process MEDLINE documents on a large scale. CONCLUSIONS: We conclude that MeSH Now is a robust approach with state-of-the-art performance for automatic MeSH indexing and that MeSH Now is capable of processing PubMed scale documents within a reasonable time frame. Availability: http://www.ncbi.nlm.nih.gov/CBBresearch/Lu/Demo/MeSHNow/.
format Online
Article
Text
id pubmed-5392968
institution National Center for Biotechnology Information
language English
publishDate 2017
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-53929682017-04-20 MeSH Now: automatic MeSH indexing at PubMed scale via learning to rank Mao, Yuqing Lu, Zhiyong J Biomed Semantics Research BACKGROUND: MeSH indexing is the task of assigning relevant MeSH terms based on a manual reading of scholarly publications by human indexers. The task is highly important for improving literature retrieval and many other scientific investigations in biomedical research. Unfortunately, given its manual nature, the process of MeSH indexing is both time-consuming (new articles are not immediately indexed until 2 or 3 months later) and costly (approximately ten dollars per article). In response, automatic indexing by computers has been previously proposed and attempted but remains challenging. In order to advance the state of the art in automatic MeSH indexing, a community-wide shared task called BioASQ was recently organized. METHODS: We propose MeSH Now, an integrated approach that first uses multiple strategies to generate a combined list of candidate MeSH terms for a target article. Through a novel learning-to-rank framework, MeSH Now then ranks the list of candidate terms based on their relevance to the target article. Finally, MeSH Now selects the highest-ranked MeSH terms via a post-processing module. RESULTS: We assessed MeSH Now on two separate benchmarking datasets using traditional precision, recall and F(1)-score metrics. In both evaluations, MeSH Now consistently achieved over 0.60 in F-score, ranging from 0.610 to 0.612. Furthermore, additional experiments show that MeSH Now can be optimized by parallel computing in order to process MEDLINE documents on a large scale. CONCLUSIONS: We conclude that MeSH Now is a robust approach with state-of-the-art performance for automatic MeSH indexing and that MeSH Now is capable of processing PubMed scale documents within a reasonable time frame. Availability: http://www.ncbi.nlm.nih.gov/CBBresearch/Lu/Demo/MeSHNow/. BioMed Central 2017-04-17 /pmc/articles/PMC5392968/ /pubmed/28412964 http://dx.doi.org/10.1186/s13326-017-0123-3 Text en © The Author(s). 2017 Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
spellingShingle Research
Mao, Yuqing
Lu, Zhiyong
MeSH Now: automatic MeSH indexing at PubMed scale via learning to rank
title MeSH Now: automatic MeSH indexing at PubMed scale via learning to rank
title_full MeSH Now: automatic MeSH indexing at PubMed scale via learning to rank
title_fullStr MeSH Now: automatic MeSH indexing at PubMed scale via learning to rank
title_full_unstemmed MeSH Now: automatic MeSH indexing at PubMed scale via learning to rank
title_short MeSH Now: automatic MeSH indexing at PubMed scale via learning to rank
title_sort mesh now: automatic mesh indexing at pubmed scale via learning to rank
topic Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5392968/
https://www.ncbi.nlm.nih.gov/pubmed/28412964
http://dx.doi.org/10.1186/s13326-017-0123-3
work_keys_str_mv AT maoyuqing meshnowautomaticmeshindexingatpubmedscalevialearningtorank
AT luzhiyong meshnowautomaticmeshindexingatpubmedscalevialearningtorank