Hyperedge Representations with Hypergraph Wavelets: Applications to Spatial Transcriptomics
In many data-driven applications, higher-order relationships among multiple objects are essential in capturing complex interactions. Hypergraphs, which generalize graphs by allowing edges to connect any number of nodes, provide a flexible and powerful framework for modeling such higher-order relationships. In this work, we introduce hypergraph diffusion wavelets and describe their favorable spectral and spatial properties. We demonstrate their utility for biomedical discovery in spatially resolved transcriptomics by applying the method to represent disease-relevant cellular niches for Alzheimer's disease.
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Enhancing Hyperedge Prediction with Context-Aware Self-Supervised Learning
Hypergraphs can naturally model group-wise relations (e.g., a group of users who co-purchase an item) as hyperedges. Hyperedge prediction is to predict future or unobserved hyperedges, which is a fundamental task in many…
Contrastive LearningHyperedge PredictionHypergraph representationsPrediction+1Learning over Families of Sets -- Hypergraph Representation Learning for Higher Order Tasks
Graph representation learning has made major strides over the past decade. However, in many relational domains, the input data are not suited for simple graph representations as the relationships between entities go beyo…
Graph Representation Learninghyperedge classificationRepresentation LearningSHINE: SubHypergraph Inductive Neural nEtwork
Hypergraph neural networks can model multi-way connections among nodes of the graphs, which are common in real-world applications such as genetic medicine. In particular, genetic pathways or gene sets encode molecular fu…
Classification of Edge-dependent Labels of Nodes in Hypergraphs
A hypergraph is a data structure composed of nodes and hyperedges, where each hyperedge is an any-sized subset of nodes. Due to the flexibility in hyperedge size, hypergraphs represent group interactions (e.g., co-author…
ClassificationNode ClusteringSelf-supervised Hypergraphs for Learning Multiple World Interpretations
We present a method for learning multiple scene representations given a small labeled set, by exploiting the relationships between such representations in the form of a multi-task hypergraph. We also show how we can use …
Multi-Task LearningSelf-Supervised Learning