Evidence map›Paper›PMID 27455377›Full record

ArticleBMC bioinformatics2016

Improving biomedical information retrieval by linear combinations of different query expansion techniques.

Ahmed AbdoAziz Ahmed Abdulla, Hongfei Lin, Bo Xu, Santosh Kumar Banbhrani

Abstract read
In one paragraph

Article in BMC bioinformatics, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

6 citing papers in PubMed.

  1. A critical evaluation of generative query expansion on biomedical literature retrieval.Journal of the American Medical Informatics Association : JAMIA · 2026
    Article
  2. Article
  3. Article
  4. Improved biomedical term selection in pseudo relevance feedback.Database : the journal of biological databases and curation · 2018
    Article
  5. Triage by ranking to support the curation of protein interactions.Database : the journal of biological databases and curation · 2017
    Article
  6. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Ahmed AbdoAziz Ahmed AbdullaSchool of Computer Science and Technology, Dalian University of Technology, No.2 Linggong Rd., Dalian, 116024, People's Republic of China.
Hongfei LinSchool of Computer Science and Technology, Dalian University of Technology, No.2 Linggong Rd., Dalian, 116024, People's Republic of China. hflin@dlut.edu.cn.
Bo XuSchool of Computer Science and Technology, Dalian University of Technology, No.2 Linggong Rd., Dalian, 116024, People's Republic of China.
Santosh Kumar BanbhraniSchool of Computer Science and Technology, Dalian University of Technology, No.2 Linggong Rd., Dalian, 116024, People's Republic of China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundBiomedical literature retrieval is becoming increasingly complex, and there is a fundamental need for advanced information retrieval systems. Information Retrieval (IR) programs scour unstructured materials such as text documents in large reserves of data that are usually stored on computers. IR is related to the representation, storage, and organization of information items, as well as to access. In IR one of the main problems is to determine which documents are relevant and which are not to the user's needs. Under the current regime, users cannot precisely construct queries in an accurate way to retrieve particular pieces of data from large reserves of data. Basic information retrieval systems are producing low-quality search results. In our proposed system for this paper we present a new technique to refine Information Retrieval searches to better represent the user's information need in order to enhance the performance of information retrieval by using different query expansion techniques and apply a linear combinations between them, where the combinations was linearly between two expansion results at one time. Query expansions expand the search query, for example, by finding synonyms and reweighting original terms. They provide significantly more focused, particularized search results than do basic search queries.

resultsThe retrieval performance is measured by some variants of MAP (Mean Average Precision) and according to our experimental results, the combination of best results of query expansion is enhanced the retrieved documents and outperforms our baseline by 21.06 %, even it outperforms a previous study by 7.12 %.

conclusionsWe propose several query expansion techniques and their combinations (linearly) to make user queries more cognizable to search engines and to produce higher-quality search results.

Indexed as

AlgorithmsInformation SystemsSemanticsBiomedical information retrievalLinear combination of query resultsQuery expansion

Identifiers

PMID27455377
PMCPMC4965722

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.