Scalable Knowledge Graph Construction and Inference on Human Genome Variants

• URL: http://arxiv.org/abs/2312.04423v1
• Date: Thu, 7 Dec 2023 16:48:32 GMT
• Title: Scalable Knowledge Graph Construction and Inference on Human Genome Variants
• Authors: Shivika Prasanna, Deepthi Rao, Eduardo Simoes, Praveen Rao
• Abstract summary: Real-world knowledge can be represented as a graph consisting of entities and relationships between them. In this work, variant-level information extracted from the RNA-sequences of vaccine-na"ive COVID-19 patients have been represented as a unified, large knowledge graph.
• Score: 2.8523023316864413
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Real-world knowledge can be represented as a graph consisting of entities and relationships between the entities. The need for efficient and scalable solutions arises when dealing with vast genomic data, like RNA-sequencing. Knowledge graphs offer a powerful approach for various tasks in such large-scale genomic data, such as analysis and inference. In this work, variant-level information extracted from the RNA-sequences of vaccine-na\"ive COVID-19 patients have been represented as a unified, large knowledge graph. Variant call format (VCF) files containing the variant-level information were annotated to include further information for each variant. The data records in the annotated files were then converted to Resource Description Framework (RDF) triples. Each VCF file obtained had an associated CADD scores file that contained the raw and Phred-scaled scores for each variant. An ontology was defined for the VCF and CADD scores files. Using this ontology and the extracted information, a large, scalable knowledge graph was created. Available graph storage was then leveraged to query and create datasets for further downstream tasks. We also present a case study using the knowledge graph and perform a classification task using graph machine learning. We also draw comparisons between different Graph Neural Networks (GNNs) for the case study.

Related papers

• Graph-Anchored Knowledge Indexing for Retrieval-Augmented Generation [53.42323544075114]
  We propose GraphAnchor, a novel Graph-Anchored Knowledge Indexing approach.<n> Experiments on four multi-hop question answering benchmarks demonstrate the effectiveness of GraphAnchor.
  arXiv  Detail & Related papers  (2026-01-23T05:41:05Z)
• Performance Heterogeneity in Graph Neural Networks: Lessons for Architecture Design and Preprocessing [1.1126342180866644]
  Graph Neural Networks have emerged as the most popular architecture for graph-level learning. We show that good performance in practice requires careful model design. We propose a selective approach, which only targets graphs whose individual performance benefits from rewiring.
  arXiv  Detail & Related papers  (2025-03-01T16:18:07Z)
• GraphBridge: Towards Arbitrary Transfer Learning in GNNs [65.01790632978962]
  GraphBridge is a novel framework to enable knowledge transfer across disparate tasks and domains in GNNs. It allows for the augmentation of any pre-trained GNN with prediction heads and a bridging network that connects the input to the output layer. Empirical validation, conducted over 16 datasets representative of these scenarios, confirms the framework's capacity for task- and domain-agnostic transfer learning.
  arXiv  Detail & Related papers  (2025-02-26T15:57:51Z)
• Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees [50.78679002846741]
  We introduce a novel approach for learning cross-task generalities in graphs. We propose task-trees as basic learning instances to align task spaces on graphs. Our findings indicate that when a graph neural network is pretrained on diverse task-trees, it acquires transferable knowledge.
  arXiv  Detail & Related papers  (2024-12-21T02:07:43Z)
• A Scalable Tool For Analyzing Genomic Variants Of Humans Using Knowledge Graphs and Machine Learning [7.928994572633366]
  We present a comprehensive approach for leveraging knowledge graphs and graph machine learning to analyze genomic variants. The proposed method involves extracting variant-level genetic information, annotating the data with additional metadata using SnpEff, and converting the enriched Variant Call Format files into Resource Description Framework triples. The resulting knowledge graph is further enhanced with patient metadata and stored in a graph database, facilitating efficient querying and indexing.
  arXiv  Detail & Related papers  (2024-07-30T14:56:10Z)
• Scalable and Flexible Causal Discovery with an Efficient Test for Adjacency [48.769884734826974]
  We build a scalable and flexible method to evaluate if two variables are adjacent in a causal graph. The Differentiable Adjacency Test replaces an exponential number of tests with a provably equivalent relaxed problem. We also build a graph learning method based on DAT, DAT-Graph, that can also learn from data with interventions.
  arXiv  Detail & Related papers  (2024-06-13T14:39:40Z)
• TGNN: A Joint Semi-supervised Framework for Graph-level Classification [34.300070497510276]
  We propose a novel semi-supervised framework called Twin Graph Neural Network (TGNN) To explore graph structural information from complementary views, our TGNN has a message passing module and a graph kernel module. We evaluate our TGNN on various public datasets and show that it achieves strong performance.
  arXiv  Detail & Related papers  (2023-04-23T15:42:11Z)
• Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modeling [60.0185734837814]
  Graph neural networks (GNNs) have found extensive applications in learning from graph data. To bolster the generalization capacity of GNNs, it has become customary to augment training graph structures with techniques like graph augmentations. This study introduces the concept of Mixture-of-Experts (MoE) to GNNs, with the aim of augmenting their capacity to adapt to a diverse range of training graph structures.
  arXiv  Detail & Related papers  (2023-04-06T01:09:36Z)
• Learnable Graph Matching: A Practical Paradigm for Data Association [74.28753343714858]
  We propose a general learnable graph matching method to address these issues. Our method achieves state-of-the-art performance on several MOT datasets. For image matching, our method outperforms state-of-the-art methods on a popular indoor dataset, ScanNet.
  arXiv  Detail & Related papers  (2023-03-27T17:39:00Z)
• Graph-based Knowledge Distillation: A survey and experimental evaluation [4.713436329217004]
  Knowledge Distillation (KD) has been introduced to enhance existing Graph Neural Networks (GNNs) KD involves transferring the soft-label supervision of the large teacher model to the small student model while maintaining prediction performance. This paper first introduces the background of graph and KD. It then provides a comprehensive summary of three types of Graph-based Knowledge Distillation methods.
  arXiv  Detail & Related papers  (2023-02-27T11:39:23Z)
• Neural Graph Matching for Pre-training Graph Neural Networks [72.32801428070749]
  Graph neural networks (GNNs) have been shown powerful capacity at modeling structural data. We present a novel Graph Matching based GNN Pre-Training framework, called GMPT. The proposed method can be applied to fully self-supervised pre-training and coarse-grained supervised pre-training.
  arXiv  Detail & Related papers  (2022-03-03T09:53:53Z)
• Scalable Graph Neural Networks for Heterogeneous Graphs [12.44278942365518]
  Graph neural networks (GNNs) are a popular class of parametric model for learning over graph-structured data. Recent work has argued that GNNs primarily use the graph for feature smoothing, and have shown competitive results on benchmark tasks. In this work, we ask whether these results can be extended to heterogeneous graphs, which encode multiple types of relationship between different entities.
  arXiv  Detail & Related papers  (2020-11-19T06:03:35Z)
• Graph Contrastive Learning with Augmentations [109.23158429991298]
  We propose a graph contrastive learning (GraphCL) framework for learning unsupervised representations of graph data. We show that our framework can produce graph representations of similar or better generalizability, transferrability, and robustness compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-10-22T20:13:43Z)
• Graph Representation Learning Network via Adaptive Sampling [4.996520403438455]
  Graph Attention Network (GAT) and GraphSAGE are neural network architectures that operate on graph-structured data. One challenge raised by GraphSAGE is how to smartly combine neighbour features based on graph structure. We propose a new architecture to address these issues that is more efficient and is capable of incorporating different edge type information.
  arXiv  Detail & Related papers  (2020-06-08T14:36:20Z)
• ENT-DESC: Entity Description Generation by Exploring Knowledge Graph [53.03778194567752]
  In practice, the input knowledge could be more than enough, since the output description may only cover the most significant knowledge. We introduce a large-scale and challenging dataset to facilitate the study of such a practical scenario in KG-to-text. We propose a multi-graph structure that is able to represent the original graph information more comprehensively.
  arXiv  Detail & Related papers  (2020-04-30T14:16:19Z)

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.