ArticleJournal of biomedical informatics2015
Context-driven automatic subgraph creation for literature-based discovery.
Article in Journal of biomedical informatics, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 30 papers.
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.
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.
Who cites it
30 citing papers in PubMed.
- Context-Aware Multilevel Classification of Semantic Relations in Drug-Adverse Drug Reaction (ADR) Networks-Predicting Drug-Induced Liver Injury (DILI) as a Case Study.Chemical research in toxicology · 2026Article
- Automated biomedical hypothesis generation with time-aware hypergraph contrastive learning.Knowledge and information systems · 2026Article
- ConceptDrift: leveraging spatial, temporal and semantic evolution of biomedical concepts for hypothesis generation.Bioinformatics (Oxford, England) · 2025Article
- Dyport: dynamic importance-based biomedical hypothesis generation benchmarking technique.BMC bioinformatics · 2024Article
- Learning to Rank Complex Biomedical Hypotheses for Accelerating Scientific Discovery.Proceedings. IEEE International Conference on Healthcare Informatics · 2024Article
- Optimizations for Computing Relatedness in Biomedical Heterogeneous Information Networks: SemNet 2.0.Big data and cognitive computing · 2022Article
- Computational Literature-based Discovery for Natural Products Research: Current State and Future Prospects.Frontiers in bioinformatics · 2022Review
- MeSHHeading2vec: a new method for representing MeSH headings as vectors based on graph embedding algorithm.Briefings in bioinformatics · 2021Article
- Drug repurposing for COVID-19 via knowledge graph completion.Journal of biomedical informatics · 2021Article
- Using Literature Based Discovery to Gain Insights Into the Metabolomic Processes of Cardiac Arrest.Frontiers in research metrics and analytics · 2021Article
- Exploration of Shared Themes Between Food Security and Internet of Things Research Through Literature-Based Discovery.Frontiers in research metrics and analytics · 2021Article
- Broad-coverage biomedical relation extraction with SemRep.BMC bioinformatics · 2020Article
- Article
- Exploring Novel Computable Knowledge in Structured Drug Product Labels.AMIA Joint Summits on Translational Science proceedings. AMIA Joint Summits on Translational Science · 2020Article
- Indirect association and ranking hypotheses for literature based discovery.BMC bioinformatics · 2019Article
- deepBioWSD: effective deep neural word sense disambiguation of biomedical text data.Journal of the American Medical Informatics Association : JAMIA · 2019Article
- Relation path feature embedding based convolutional neural network method for drug discovery.BMC medical informatics and decision making · 2019Article
- A context-based ABC model for literature-based discovery.PloS one · 2019Article
- A Literature Based Discovery Visualization System with Hierarchical Clustering and Linking Set Associations.AMIA Joint Summits on Translational Science proceedings. AMIA Joint Summits on Translational Science · 2019Article
- A systematic review on literature-based discovery workflow.PeerJ. Computer science · 2019Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
backgroundLiterature-based discovery (LBD) is characterized by uncovering hidden associations in non-interacting scientific literature. Prior approaches to LBD include use of: (1) domain expertise and structured background knowledge to manually filter and explore the literature, (2) distributional statistics and graph-theoretic measures to rank interesting connections, and (3) heuristics to help eliminate spurious connections. However, manual approaches to LBD are not scalable and purely distributional approaches may not be sufficient to obtain insights into the meaning of poorly understood associations. While several graph-based approaches have the potential to elucidate associations, their effectiveness has not been fully demonstrated. A considerable degree of a priori knowledge, heuristics, and manual filtering is still required.
objectivesIn this paper we implement and evaluate a context-driven, automatic subgraph creation method that captures multifaceted complex associations between biomedical concepts to facilitate LBD. Given a pair of concepts, our method automatically generates a ranked list of subgraphs, which provide informative and potentially unknown associations between such concepts.
methodsTo generate subgraphs, the set of all MEDLINE articles that contain either of the two specified concepts (A, C) are first collected. Then binary relationships or assertions, which are automatically extracted from the MEDLINE articles, called semantic predications, are used to create a labeled directed predications graph. In this predications graph, a path is represented as a sequence of semantic predications. The hierarchical agglomerative clustering (HAC) algorithm is then applied to cluster paths that are bounded by the two concepts (A, C). HAC relies on implicit semantics captured through Medical Subject Heading (MeSH) descriptors, and explicit semantics from the MeSH hierarchy, for clustering. Paths that exceed a threshold of semantic relatedness are clustered into subgraphs based on their shared context. Finally, the automatically generated clusters are provided as a ranked list of subgraphs.
resultsThe subgraphs generated using this approach facilitated the rediscovery of 8 out of 9 existing scientific discoveries. In particular, they directly (or indirectly) led to the recovery of several intermediates (or B-concepts) between A- and C-terms, while also providing insights into the meaning of the associations. Such meaning is derived from predicates between the concepts, as well as the provenance of the semantic predications in MEDLINE. Additionally, by generating subgraphs on different thematic dimensions (such as Cellular Activity, Pharmaceutical Treatment and Tissue Function), the approach may enable a broader understanding of the nature of complex associations between concepts. Finally, in a statistical evaluation to determine the interestingness of the subgraphs, it was observed that an arbitrary association is mentioned in only approximately 4 articles in MEDLINE on average.
conclusionThese results suggest that leveraging the implicit and explicit semantics provided by manually assigned MeSH descriptors is an effective representation for capturing the underlying context of complex associations, along multiple thematic dimensions in LBD situations.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.