Latent Graphs for Semi-Supervised Learning on Biomedical Tabular Data

• URL: http://arxiv.org/abs/2309.15757v3
• Date: Sat, 14 Oct 2023 09:11:27 GMT
• Title: Latent Graphs for Semi-Supervised Learning on Biomedical Tabular Data
• Authors: Boshko Koloski and Nada Lavra\v{c} and Senja Pollak and Bla\v{z} \v{S}krlj
• Abstract summary: In this work, we provide an approach for inferring latent graphs that capture the intrinsic data relationships. By leveraging graph-based representations, our approach facilitates the seamless propagation of information throughout the graph. Our work demonstrates the significance of inter-instance relationship discovery as practical means for constructing robust latent graphs.
• Score: 4.498659756007485
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the domain of semi-supervised learning, the current approaches insufficiently exploit the potential of considering inter-instance relationships among (un)labeled data. In this work, we address this limitation by providing an approach for inferring latent graphs that capture the intrinsic data relationships. By leveraging graph-based representations, our approach facilitates the seamless propagation of information throughout the graph, effectively incorporating global and local knowledge. Through evaluations on biomedical tabular datasets, we compare the capabilities of our approach to other contemporary methods. Our work demonstrates the significance of inter-instance relationship discovery as practical means for constructing robust latent graphs to enhance semi-supervised learning techniques. The experiments show that the proposed methodology outperforms contemporary state-of-the-art methods for (semi-)supervised learning on three biomedical datasets.

Related papers

• GTP-4o: Modality-prompted Heterogeneous Graph Learning for Omni-modal Biomedical Representation [68.63955715643974]
  Modality-prompted Heterogeneous Graph for Omnimodal Learning (GTP-4o) We propose an innovative Modality-prompted Heterogeneous Graph for Omnimodal Learning (GTP-4o)
  arXiv  Detail & Related papers  (2024-07-08T01:06:13Z)
• Integration of Self-Supervised BYOL in Semi-Supervised Medical Image Recognition [10.317372960942972]
  We propose an innovative approach by integrating self-supervised learning into semi-supervised models to enhance medical image recognition. Our approach optimally leverages unlabeled data, outperforming existing methods in terms of accuracy for medical image recognition.
  arXiv  Detail & Related papers  (2024-04-16T09:12:16Z)
• Graph Relation Distillation for Efficient Biomedical Instance Segmentation [80.51124447333493]
  We propose a graph relation distillation approach for efficient biomedical instance segmentation. We introduce two graph distillation schemes deployed at both the intra-image level and the inter-image level. Experimental results on a number of biomedical datasets validate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2024-01-12T04:41:23Z)
• Bures-Wasserstein Means of Graphs [60.42414991820453]
  We propose a novel framework for defining a graph mean via embeddings in the space of smooth graph signal distributions. By finding a mean in this embedding space, we can recover a mean graph that preserves structural information. We establish the existence and uniqueness of the novel graph mean, and provide an iterative algorithm for computing it.
  arXiv  Detail & Related papers  (2023-05-31T11:04:53Z)
• Graph Contrastive Learning for Multi-omics Data [0.0]
  We present a learnining framework named Multi-Omics Graph Contrastive Learner(MOGCL) We show that pre-training graph models with a contrastive methodology along with fine-tuning it in a supervised manner is an efficient strategy for multi-omics data classification.
  arXiv  Detail & Related papers  (2023-01-03T10:03:08Z)
• Interpolation-based Correlation Reduction Network for Semi-Supervised Graph Learning [49.94816548023729]
  We propose a novel graph contrastive learning method, termed Interpolation-based Correlation Reduction Network (ICRN) In our method, we improve the discriminative capability of the latent feature by enlarging the margin of decision boundaries. By combining the two settings, we extract rich supervision information from both the abundant unlabeled nodes and the rare yet valuable labeled nodes for discnative representation learning.
  arXiv  Detail & Related papers  (2022-06-06T14:26:34Z)
• A Topological Approach for Semi-Supervised Learning [0.0]
  We present new semi-supervised learning methods based on techniques from Topological Data Analysis (TDA) In particular, we have created two semi-supervised learning methods following two different topological approaches. The results show that the methods developed in this work outperform both the results obtained with models trained with only manually labelled data, and those obtained with classical semi-supervised learning methods.
  arXiv  Detail & Related papers  (2022-05-19T15:23:39Z)
• Neural Multi-Hop Reasoning With Logical Rules on Biomedical Knowledge Graphs [10.244651735862627]
  We conduct an empirical study based on the real-world task of drug repurposing. We formulate this task as a link prediction problem where both compounds and diseases correspond to entities in a knowledge graph. We propose a new method, PoLo, that combines policy-guided walks based on reinforcement learning with logical rules.
  arXiv  Detail & Related papers  (2021-03-18T16:46:11Z)
• Dual-Teacher: Integrating Intra-domain and Inter-domain Teachers for Annotation-efficient Cardiac Segmentation [65.81546955181781]
  We propose a novel semi-supervised domain adaptation approach, namely Dual-Teacher. The student model learns the knowledge of unlabeled target data and labeled source data by two teacher models. We demonstrate that our approach is able to concurrently utilize unlabeled data and cross-modality data with superior performance.
  arXiv  Detail & Related papers  (2020-07-13T10:00:44Z)
• Integrating Logical Rules Into Neural Multi-Hop Reasoning for Drug Repurposing [23.783111050856245]
  We propose a novel method that combines these rules with a neural multi-hop reasoning approach that uses reinforcement learning. We apply our method to the biomedical knowledge graph Hetionet and show that our approach outperforms several baseline methods.
  arXiv  Detail & Related papers  (2020-07-10T10:32:08Z)
• Graph Representation Learning via Graphical Mutual Information Maximization [86.32278001019854]
  We propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. We develop an unsupervised learning model trained by maximizing GMI between the input and output of a graph neural encoder.
  arXiv  Detail & Related papers  (2020-02-04T08:33:49Z)

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.