Learning graph representations of biochemical networks and its application to enzymatic link prediction
원문 초록
The complete characterization of enzymatic activities between molecules remains incomplete, hindering biological engineering and limiting biological discovery. We develop in this work a technique, Enzymatic Link Prediction (ELP), for predicting the likelihood of an enzymatic transformation between two molecules. ELP models enzymatic reactions catalogued in the KEGG database as a graph. ELP is innovative over prior works in using graph embedding to learn molecular representations that capture not only molecular and enzymatic attributes but also graph connectivity. We explore both transductive (test nodes included in the training graph) and inductive (test nodes not part of the training graph) learning models. We show that ELP achieves high AUC when learning node embeddings using both graph connectivity and node attributes. Further, we show that graph embedding for predicting enzymatic links improves link prediction by 24% over fingerprint-similarity-based approaches. To emphasize the importance of graph embedding in the context of biochemical networks, we illustrate how graph embedding can also guide visualization. The code and datasets are available through https://github.com/HassounLab/ELP.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Trajectory Encoding Temporal Graph Networks
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
AdvSGM: Differentially Private Graph Learning via Adversarial Skip-gram Model
Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding
Exploring Graph Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.