Improving Enzyme Prediction with Chemical Reaction Equations by Hypergraph-Enhanced Knowledge Graph Embeddings
Not on the map. Why?
Abstract (arXiv)
Predicting enzyme-substrate interactions has long been a fundamental problem in biochemistry and metabolic engineering. While existing methods could leverage databases of expert-curated enzyme-substrate pairs for models to learn from known pair interactions, the databases are often sparse, i.e., there are only limited and incomplete examples of such pairs, and also labor-intensive to maintain. This lack of sufficient training data significantly hinders the ability of traditional enzyme prediction models to generalize to unseen interactions. In this work, we try to exploit chemical reaction equations from domain-specific databases, given their easier accessibility and denser, more abundant data. However, interactions of multiple compounds, e.g., educts and products, with the same enzymes create complex relational data patterns that traditional models cannot easily capture. To tackle that, we represent chemical reaction equations as triples of (educt, enzyme, product) within a knowledge graph, such that we can take advantage of knowledge graph embedding (KGE) to infer missing enzyme-substrate pairs for graph completion. Particularly, in order to capture intricate relationships among compounds, we propose our knowledge-enhanced hypergraph model for enzyme prediction, i.e., Hyper-Enz, which integrates a hypergraph transformer with a KGE model to learn representations of the hyper-edges that involve multiple educts and products. Also, a multi-expert paradigm is introduced to guide the learning of enzyme-substrate interactions with both the proposed model and chemical reaction equations. Experimental results show a significant improvement, with up to a 88% relative improvement in average enzyme retrieval accuracy and 30% improvement in pair-level prediction compared to traditional models, demonstrating the effectiveness of our approach.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 16 of its 39 references that are in the map. First posted on arXiv 8 Jan 2026.
Builds on
16 of 39 references.
References · 16
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2017Neural Collaborative Filteringcited by 1,108
- 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 929
- 2016Complex Embeddings for Simple Link Predictioncited by 897
- 2017Convolutional 2D Knowledge Graph Embeddingscited by 729
- 2019Neural Graph Collaborative Filteringcited by 660
- 2019TuckER: Tensor Factorization for Knowledge Graph Completioncited by 290
- 2017A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Networkcited by 143
- 2021You are AllSet: A Multiset Function Framework for Hypergraph Neural Networkscited by 124
- 2020Disentangled Graph Collaborative Filteringcited by 118
- 2020PairRE: Knowledge Graph Embeddings via Paired Relation Vectorscited by 67
- 2022Hypergraph Contrastive Collaborative Filteringcited by 63
4 more
- 2022HousE: Knowledge Graph Embedding with Householder Parameterizationcited by 29
- 2021Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embeddingcited by 15
- 2024ReactZyme: A Benchmark for Enzyme-Reaction Predictioncited by 13
- 2021Boost-RS: Boosted Embeddings for Recommender Systems and its Application to Enzyme-Substrate Interaction Predictioncited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.