2018
DOI: 10.1371/journal.pbio.2005343
|View full text |Cite
|
Sign up to set email alerts
|

Best Match: New relevance search for PubMed

Abstract: 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 so… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
89
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 102 publications
(91 citation statements)
references
References 33 publications
0
89
0
Order By: Relevance
“…The first step consists in a textual search process by using the Vector Space Model; nonetheless, this step may be replaced with any other well-known model like that used by the PubMed Best Match System (BM25), giving an example used in Medicine [34] . This model is the same as that implemented in the study [18] used to compare our approach.…”
Section: Discussionmentioning
confidence: 99%
“…The first step consists in a textual search process by using the Vector Space Model; nonetheless, this step may be replaced with any other well-known model like that used by the PubMed Best Match System (BM25), giving an example used in Medicine [34] . This model is the same as that implemented in the study [18] used to compare our approach.…”
Section: Discussionmentioning
confidence: 99%
“…The following weighting schemes are used in our experiments to produce document rankings for an atomic clause: IDF, TF-IDF, BM25, InL2 of Divergence from Randomness, PubMed, term position, text score, publication date, and document length. The PubMed weighting scheme uses the state-of-the-art learning to rank system of Pubmed [20]. The best match ranking system of PubMed uses a three-stage ranking system: first, documents are retrieved using the Boolean query; then, documents are ranked using BM25; finally, top-ranked documents are re-ranked using LambdaMART trained on click data, using document features such as document length, publication date, and past usage.…”
Section: Methodsmentioning
confidence: 99%
“…Soldaini et al [31] applied query reformulation techniques to address the need of literature search based on case reports. Best Match [6] is the first relevance search algorithm for PubMed that leverages the intelligence of users and machine-learning technology as an alternative to the traditional sorting techniques. Delta [25] is a deep learning based model that applies convolution operation upon an updated document matrix in which each word is replaced with the most similar word in the query.…”
Section: Related Work 21 Biomedical Literature Retrievalmentioning
confidence: 99%