Temporal Positive-unlabeled Learning for Biomedical Hypothesis Generation via Risk Estimation

• URL: http://arxiv.org/abs/2010.01916v1
• Date: Mon, 5 Oct 2020 10:58:03 GMT
• Title: Temporal Positive-unlabeled Learning for Biomedical Hypothesis Generation via Risk Estimation
• Authors: Uchenna Akujuobi, Jun Chen, Mohamed Elhoseiny, Michael Spranger, Xiangliang Zhang
• Abstract summary: This paper aims to introduce the use of machine learning to the scientific process of hypothesis generation. We propose a variational inference model to estimate the positive prior, and incorporate it in the learning of node pair embeddings. Experiment results on real-world biomedical term relationship datasets and case study analyses on a COVID-19 dataset validate the effectiveness of the proposed model.
• Score: 46.852387038668695
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Understanding the relationships between biomedical terms like viruses, drugs, and symptoms is essential in the fight against diseases. Many attempts have been made to introduce the use of machine learning to the scientific process of hypothesis generation(HG), which refers to the discovery of meaningful implicit connections between biomedical terms. However, most existing methods fail to truly capture the temporal dynamics of scientific term relations and also assume unobserved connections to be irrelevant (i.e., in a positive-negative (PN) learning setting). To break these limits, we formulate this HG problem as future connectivity prediction task on a dynamic attributed graph via positive-unlabeled (PU) learning. Then, the key is to capture the temporal evolution of node pair (term pair) relations from just the positive and unlabeled data. We propose a variational inference model to estimate the positive prior, and incorporate it in the learning of node pair embeddings, which are then used for link prediction. Experiment results on real-world biomedical term relationship datasets and case study analyses on a COVID-19 dataset validate the effectiveness of the proposed model.

Related papers

• Multimodal Contrastive Representation Learning in Augmented Biomedical Knowledge Graphs [2.006175707670159]
  PrimeKG++ is an enriched knowledge graph incorporating multimodal data. Our approach demonstrates strong generalizability, enabling accurate link predictions even for unseen nodes.
  arXiv  Detail & Related papers  (2025-01-03T05:29:12Z)
• Causal Representation Learning from Multimodal Biological Observations [57.00712157758845]
  We aim to develop flexible identification conditions for multimodal data. We establish identifiability guarantees for each latent component, extending the subspace identification results from prior work. Our key theoretical ingredient is the structural sparsity of the causal connections among distinct modalities.
  arXiv  Detail & Related papers  (2024-11-10T16:40:27Z)
• Graph Stochastic Neural Process for Inductive Few-shot Knowledge Graph Completion [63.68647582680998]
  We focus on a task called inductive few-shot knowledge graph completion (I-FKGC) Inspired by the idea of inductive reasoning, we cast I-FKGC as an inductive reasoning problem. We present a neural process-based hypothesis extractor that models the joint distribution of hypothesis, from which we can sample a hypothesis for predictions. In the second module, based on the hypothesis, we propose a graph attention-based predictor to test if the triple in the query set aligns with the extracted hypothesis.
  arXiv  Detail & Related papers  (2024-08-03T13:37:40Z)
• Seeing Unseen: Discover Novel Biomedical Concepts via Geometry-Constrained Probabilistic Modeling [53.7117640028211]
  We present a geometry-constrained probabilistic modeling treatment to resolve the identified issues. We incorporate a suite of critical geometric properties to impose proper constraints on the layout of constructed embedding space. A spectral graph-theoretic method is devised to estimate the number of potential novel classes.
  arXiv  Detail & Related papers  (2024-03-02T00:56:05Z)
• Learning to Denoise Biomedical Knowledge Graph for Robust Molecular Interaction Prediction [50.7901190642594]
  We propose BioKDN (Biomedical Knowledge Graph Denoising Network) for robust molecular interaction prediction. BioKDN refines the reliable structure of local subgraphs by denoising noisy links in a learnable manner. It maintains consistent and robust semantics by smoothing relations around the target interaction.
  arXiv  Detail & Related papers  (2023-12-09T07:08:00Z)
• Communicative Subgraph Representation Learning for Multi-Relational Inductive Drug-Gene Interaction Prediction [17.478102754113294]
  We propose a novel Communicative Subgraph representation learning for Multi-relational Inductive drug-Gene interactions prediction (CoSMIG) The model strengthened the relations on the drug-gene graph through a communicative message passing mechanism. Our method outperformed state-of-the-art baselines in the transductive scenarios and achieved superior performance in the inductive ones.
  arXiv  Detail & Related papers  (2022-05-12T08:53:45Z)
• Algorithmic encoding of protected characteristics and its implications on disparities across subgroups [17.415882865534638]
  Machine learning models may pick up undesirable correlations between a patient's racial identity and clinical outcome. Very little is known about how these biases are encoded and how one may reduce or even remove disparate performance.
  arXiv  Detail & Related papers  (2021-10-27T20:30:57Z)
• Correct block-design experiments mitigate temporal correlation bias in EEG classification [68.85562949901077]
  We show that the main claim in [1] is drastically overstated and their other analyses are seriously flawed by wrong methodological choices. We investigate the influence of EEG temporal correlation on classification accuracy by testing the same models in two additional experimental settings.
  arXiv  Detail & Related papers  (2020-11-25T22:25:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.