Cargando…
Best Match: New relevance search for PubMed
PubMed is a free search engine for biomedical literature accessed by millions of users from around the world each day. With the rapid growth of biomedical literature—about two articles are added every minute on average—finding and retrieving the most relevant papers for a given query is increasingly...
Autores principales: | , , , , , , , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6112631/ https://www.ncbi.nlm.nih.gov/pubmed/30153250 http://dx.doi.org/10.1371/journal.pbio.2005343 |
_version_ | 1783350879904071680 |
---|---|
author | Fiorini, Nicolas Canese, Kathi Starchenko, Grisha Kireev, Evgeny Kim, Won Miller, Vadim Osipov, Maxim Kholodov, Michael Ismagilov, Rafis Mohan, Sunil Ostell, James Lu, Zhiyong |
author_facet | Fiorini, Nicolas Canese, Kathi Starchenko, Grisha Kireev, Evgeny Kim, Won Miller, Vadim Osipov, Maxim Kholodov, Michael Ismagilov, Rafis Mohan, Sunil Ostell, James Lu, Zhiyong |
author_sort | Fiorini, Nicolas |
collection | PubMed |
description | PubMed is a free search engine for biomedical literature accessed by millions of users from around the world each day. With the rapid growth of biomedical literature—about two articles are added every minute on average—finding and retrieving the most relevant papers for a given query is increasingly challenging. We present Best Match, a new relevance search algorithm for PubMed that leverages the intelligence of our users and cutting-edge machine-learning technology as an alternative to the traditional date sort order. The Best Match algorithm is trained with past user searches with dozens of relevance-ranking signals (factors), the most important being the past usage of an article, publication date, relevance score, and type of article. This new algorithm demonstrates state-of-the-art retrieval performance in benchmarking experiments as well as an improved user experience in real-world testing (over 20% increase in user click-through rate). Since its deployment in June 2017, we have observed a significant increase (60%) in PubMed searches with relevance sort order: it now assists millions of PubMed searches each week. In this work, we hope to increase the awareness and transparency of this new relevance sort option for PubMed users, enabling them to retrieve information more effectively. |
format | Online Article Text |
id | pubmed-6112631 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-61126312018-09-17 Best Match: New relevance search for PubMed Fiorini, Nicolas Canese, Kathi Starchenko, Grisha Kireev, Evgeny Kim, Won Miller, Vadim Osipov, Maxim Kholodov, Michael Ismagilov, Rafis Mohan, Sunil Ostell, James Lu, Zhiyong PLoS Biol Community Page PubMed is a free search engine for biomedical literature accessed by millions of users from around the world each day. With the rapid growth of biomedical literature—about two articles are added every minute on average—finding and retrieving the most relevant papers for a given query is increasingly challenging. We present Best Match, a new relevance search algorithm for PubMed that leverages the intelligence of our users and cutting-edge machine-learning technology as an alternative to the traditional date sort order. The Best Match algorithm is trained with past user searches with dozens of relevance-ranking signals (factors), the most important being the past usage of an article, publication date, relevance score, and type of article. This new algorithm demonstrates state-of-the-art retrieval performance in benchmarking experiments as well as an improved user experience in real-world testing (over 20% increase in user click-through rate). Since its deployment in June 2017, we have observed a significant increase (60%) in PubMed searches with relevance sort order: it now assists millions of PubMed searches each week. In this work, we hope to increase the awareness and transparency of this new relevance sort option for PubMed users, enabling them to retrieve information more effectively. Public Library of Science 2018-08-28 /pmc/articles/PMC6112631/ /pubmed/30153250 http://dx.doi.org/10.1371/journal.pbio.2005343 Text en https://creativecommons.org/publicdomain/zero/1.0/ This is an open access article, free of all copyright, and may be freely reproduced, distributed, transmitted, modified, built upon, or otherwise used by anyone for any lawful purpose. The work is made available under the Creative Commons CC0 (https://creativecommons.org/publicdomain/zero/1.0/) public domain dedication. |
spellingShingle | Community Page Fiorini, Nicolas Canese, Kathi Starchenko, Grisha Kireev, Evgeny Kim, Won Miller, Vadim Osipov, Maxim Kholodov, Michael Ismagilov, Rafis Mohan, Sunil Ostell, James Lu, Zhiyong Best Match: New relevance search for PubMed |
title | Best Match: New relevance search for PubMed |
title_full | Best Match: New relevance search for PubMed |
title_fullStr | Best Match: New relevance search for PubMed |
title_full_unstemmed | Best Match: New relevance search for PubMed |
title_short | Best Match: New relevance search for PubMed |
title_sort | best match: new relevance search for pubmed |
topic | Community Page |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6112631/ https://www.ncbi.nlm.nih.gov/pubmed/30153250 http://dx.doi.org/10.1371/journal.pbio.2005343 |
work_keys_str_mv | AT fiorininicolas bestmatchnewrelevancesearchforpubmed AT canesekathi bestmatchnewrelevancesearchforpubmed AT starchenkogrisha bestmatchnewrelevancesearchforpubmed AT kireevevgeny bestmatchnewrelevancesearchforpubmed AT kimwon bestmatchnewrelevancesearchforpubmed AT millervadim bestmatchnewrelevancesearchforpubmed AT osipovmaxim bestmatchnewrelevancesearchforpubmed AT kholodovmichael bestmatchnewrelevancesearchforpubmed AT ismagilovrafis bestmatchnewrelevancesearchforpubmed AT mohansunil bestmatchnewrelevancesearchforpubmed AT ostelljames bestmatchnewrelevancesearchforpubmed AT luzhiyong bestmatchnewrelevancesearchforpubmed |