Representing Outcome-driven Higher-order Dependencies in Graphs of Disease Trajectories

• URL: http://arxiv.org/abs/2312.15353v1
• Date: Sat, 23 Dec 2023 21:33:40 GMT
• Title: Representing Outcome-driven Higher-order Dependencies in Graphs of Disease Trajectories
• Authors: Steven J. Krieg, Nitesh V. Chawla, Keith Feldman
• Abstract summary: We propose a method that identifies combinations of risk factors for a given outcome and accurately encodes these higher-order relationships in a graph. Using historical data from 913,475 type 2 diabetes (T2D) patients, we found that, compared to other approaches, the proposed networks encode significantly more information about the progression of T2D toward a variety of outcomes.
• Score: 22.83957446240816
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The widespread application of machine learning techniques to biomedical data has produced many new insights into disease progression and improving clinical care. Inspired by the flexibility and interpretability of graphs (networks), as well as the potency of sequence models like transformers and higher-order networks (HONs), we propose a method that identifies combinations of risk factors for a given outcome and accurately encodes these higher-order relationships in a graph. Using historical data from 913,475 type 2 diabetes (T2D) patients, we found that, compared to other approaches, the proposed networks encode significantly more information about the progression of T2D toward a variety of outcomes. We additionally demonstrate how structural information from the proposed graph can be used to augment the performance of transformer-based models on predictive tasks, especially when the data are noisy. By increasing the order, or memory, of the graph, we show how the proposed method illuminates key risk factors while successfully ignoring noisy elements, which facilitates analysis that is simultaneously accurate and interpretable.

Related papers

• Through the Dual-Prism: A Spectral Perspective on Graph Data Augmentation for Graph Classification [71.36575018271405]
  We introduce the Dual-Prism (DP) augmentation method, comprising DP-Noise and DP-Mask. We find that keeping the low-frequency eigenvalues unchanged can preserve the critical properties at a large scale when generating augmented graphs.
  arXiv  Detail & Related papers  (2024-01-18T12:58:53Z)
• 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)
• AdaMedGraph: Adaboosting Graph Neural Networks for Personalized Medicine [31.424781716926848]
  We propose a novel algorithm named ours, which can automatically select important features to construct multiple patient similarity graphs. ours is evaluated on two real-world medical scenarios and shows superiors performance.
  arXiv  Detail & Related papers  (2023-11-24T06:27:25Z)
• Dynamic Graph Enhanced Contrastive Learning for Chest X-ray Report Generation [92.73584302508907]
  We propose a knowledge graph with Dynamic structure and nodes to facilitate medical report generation with Contrastive Learning. In detail, the fundamental structure of our graph is pre-constructed from general knowledge. Each image feature is integrated with its very own updated graph before being fed into the decoder module for report generation.
  arXiv  Detail & Related papers  (2023-03-18T03:53:43Z)
• Graph Neural Networks with Trainable Adjacency Matrices for Fault Diagnosis on Multivariate Sensor Data [69.25738064847175]
  It is necessary to consider the behavior of the signals in each sensor separately, to take into account their correlation and hidden relationships with each other. The graph nodes can be represented as data from the different sensors, and the edges can display the influence of these data on each other. It was proposed to construct a graph during the training of graph neural network. This allows to train models on data where the dependencies between the sensors are not known in advance.
  arXiv  Detail & Related papers  (2022-10-20T11:03:21Z)
• Augmentations in Hypergraph Contrastive Learning: Fabricated and Generative [126.0985540285981]
  We apply the contrastive learning approach from images/graphs (we refer to it as HyperGCL) to improve generalizability of hypergraph neural networks. We fabricate two schemes to augment hyperedges with higher-order relations encoded, and adopt three augmentation strategies from graph-structured data. We propose a hypergraph generative model to generate augmented views, and then an end-to-end differentiable pipeline to jointly learn hypergraph augmentations and model parameters.
  arXiv  Detail & Related papers  (2022-10-07T20:12:20Z)
• Graph Structure Based Data Augmentation Method [0.0]
  We design a graph-based data augmentation technique that exploits the inherent graph structures within the medical waveform data. We show that the performance gain from graph augmentation results from robustness by testing against adversarial attacks.
  arXiv  Detail & Related papers  (2022-05-29T10:16:29Z)
• Multi-modal Graph Learning for Disease Prediction [35.156975779372836]
  We propose an end-to-end Multi-modal Graph Learning framework (MMGL) for disease prediction with multi-modality. Instead of defining the graph manually, the latent graph structure is captured through an effective way of adaptive graph learning. An extensive group of experiments on two disease prediction tasks demonstrates that the proposed MMGL achieves more favorable performance.
  arXiv  Detail & Related papers  (2022-03-11T12:33:20Z)
• Multi-modal Graph Learning for Disease Prediction [35.4310911850558]
  We propose an end-to-end Multimodal Graph Learning framework (MMGL) for disease prediction. Instead of defining the adjacency matrix manually as existing methods, the latent graph structure can be captured through a novel way of adaptive graph learning.
  arXiv  Detail & Related papers  (2021-07-01T03:59:22Z)
• AMA-GCN: Adaptive Multi-layer Aggregation Graph Convolutional Network for Disease Prediction [20.19380805655623]
  We propose an encoder that automatically selects the appropriate phenotypic measures according to their spatial distribution. We also propose a novel graph convolution network architecture using multi-layer aggregation mechanism.
  arXiv  Detail & Related papers  (2021-06-16T12:13:23Z)
• Select-ProtoNet: Learning to Select for Few-Shot Disease Subtype Prediction [55.94378672172967]
  We focus on few-shot disease subtype prediction problem, identifying subgroups of similar patients. We introduce meta learning techniques to develop a new model, which can extract the common experience or knowledge from interrelated clinical tasks. Our new model is built upon a carefully designed meta-learner, called Prototypical Network, that is a simple yet effective meta learning machine for few-shot image classification.
  arXiv  Detail & Related papers  (2020-09-02T02:50:30Z)

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.