paper-with-me

홈 › Papers

SHINE: SubHypergraph Inductive Neural nEtwork

2022-10-13 · Yuan Luo

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 functions driven by multiple genes, naturally represented as hyperedges. Thus, hypergraph-guided embedding can capture functional relations in learned representations. Existing hypergraph neural network models often focus on node-level or graph-level inference. There is an unmet need in learning powerful representations of subgraphs of hypergraphs in real-world applications. For example, a cancer patient can be viewed as a subgraph of genes harboring mutations in the patient, while all the genes are connected by hyperedges that correspond to pathways representing specific molecular functions. For accurate inductive subgraph prediction, we propose SubHypergraph Inductive Neural nEtwork (SHINE). SHINE uses informative genetic pathways that encode molecular functions as hyperedges to connect genes as nodes. SHINE jointly optimizes the objectives of end-to-end subgraph classification and hypergraph nodes' similarity regularization. SHINE simultaneously learns representations for both genes and pathways using strongly dual attention message passing. The learned representations are aggregated via a subgraph attention layer and used to train a multilayer perceptron for inductive subgraph inferencing. We evaluated SHINE against a wide array of state-of-the-art (hyper)graph neural networks, XGBoost, NMF and polygenic risk score models, using large scale NGS and curated datasets. SHINE outperformed all comparison models significantly, and yielded interpretable disease models with functional insights.

📄 PDF Abstract BibTeX arXiv:2210.07309

Code (1)

luoyuanlab/shine 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Information Limits for Detecting a Subhypergraph

2021-05-05 · Mingao Yuan, Zuofeng Shang

We consider the problem of recovering a subhypergraph based on an observed adjacency tensor corresponding to a uniform hypergraph. The uniform hypergraph is assumed to contain a subset of vertices called as subhypergraph…

Heterogeneous Dense Subhypergraph Detection

2021-04-08 · Mingao Yuan, Zuofeng Shang

We study the problem of testing the existence of a heterogeneous dense subhypergraph. The null hypothesis corresponds to a heterogeneous Erd\"{o}s-R\'{e}nyi uniform random hypergraph and the alternative hypothesis corres…

Sharp detection boundaries on testing dense subhypergraph

2021-01-12 · Mingao Yuan, Zuofeng Shang

We study the problem of testing the existence of a dense subhypergraph. The null hypothesis is an Erdos-Renyi uniform random hypergraph and the alternative hypothesis is a uniform random hypergraph that contains a dense …

Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breaking

2024-02-17 · Simon Zhang, Cheng Xin, Tamal K. Dey

A hypergraph consists of a set of nodes along with a collection of subsets of the nodes called hyperedges. Higher-order link prediction is the task of predicting the existence of a missing hyperedge in a hypergraph. A hy…

GPULink Prediction

Explaining Hypergraph Neural Networks: From Local Explanations to Global Concepts

2024-10-10 · Shiye Su, Iulia Duta, Lucie Charlotte Magister, Pietro Liò

Hypergraph neural networks are a class of powerful models that leverage the message passing paradigm to learn over hypergraphs, a generalization of graphs well-suited to describing relational data with higher-order inter…