Evidence map›Paper›PMID 32477648›Full record

ArticleAMIA Joint Summits on Translational Science proceedings. AMIA Joint Summits on Translational Science2020

Text Snippets to Corroborate Medical Relations: An Unsupervised Approach using a Knowledge Graph and Embeddings.

Maulik R Kamdar, Craig E Stanley, Michael Carroll, Linda Wogulis, William Dowling, Helena F Deus, Mevan Samarasinghe

Abstract read
In one paragraph

Article in AMIA Joint Summits on Translational Science proceedings. AMIA Joint Summits on Translational Science, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

0numbers the graph read from it
0cells of the map it votes in
10citing 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

10 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. 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

7 authors.

Maulik R KamdarElsevier, Health and Commercial Markets, Philadelphia, PA.
Craig E StanleyElsevier, Health and Commercial Markets, Philadelphia, PA.
Michael CarrollElsevier, Health and Commercial Markets, Philadelphia, PA.
Linda WogulisElsevier, Health and Commercial Markets, Philadelphia, PA.
William DowlingElsevier, Health and Commercial Markets, Philadelphia, PA.
Helena F DeusElsevier, Health and Commercial Markets, Philadelphia, PA.
Mevan SamarasingheElsevier, Health and Commercial Markets, Philadelphia, PA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Knowledge graphs have been shown to significantly improve search results. Usually populated by subject matter experts, relations therein need to keep up to date with medical literature in order for search to remain relevant. Dynamically identifying text snippets in literature that confirm or deny knowledge graph triples is increasingly becoming the differentiator between trusted and untrusted medical decision support systems. This work describes our approach to mapping triples to medical text. A medical knowledge graph is used as a source of triples that are used to find matching sentences in reference text. Our unsupervised approach uses phrase embeddings and cosine similarity measures, and boosts candidate text snippets when certain key concepts exist. Using this approach, we can accurately map semantic relations within the medical knowledge graph to text snippets with a precision of 61.4% and recall of 86.3%. This method will be used to develop a novel application in the future to retrieve medical relations and corroborating snippets from medical text given a user query.

Identifiers

PMID32477648
PMCPMC7233036

What OpenQuestion holds

Textmetadata
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.