Relation type-aware knowledge graph embeddings for biomedical data: a semantically adaptive framework
Keywords:
Colorectal Cancer, Knowledge Graph Embeddings, Triple Classification, Negative Sampling
Abstract
Knowledge graphs (KGs) are increasingly used in biomedicine to integrate and reason over heterogeneous datasuch as genes, proteins, drugs, and diseases. However, existing knowledge graph embedding (KGE) methods typically rely on a single, fixed scoring function for all relation types, which limits their ability to model the semantic diversity of biomedical interactions. In this work, we propose a relation type-aware KGE framework that dynamically adapts scoring functions to the structural nature of relations hierarchical, symmetric, or asymmetric thereby improving the semantic fidelity of embeddings. We improve training with a constraint-aware negative sampling approach that creates realistic false examples. This forces the model to focus on learning true biomedical relationships instead of dismissing easy, nonsensical ones. We built our knowledge graph by grabbing biomedical papers from PubMed. Then, we ran them through some natural language processing tools. After that, we used the SemRep server to make subject-relation-object triples, which gave us the graph structure for studies on colorectal cancer. Our KG includes entities and relations at the molecular, clinical, and pharmacology levels. We set up the learning objective as a minimization problem with regularization. This combines margin-based ranking loss with relation-specific changes. We checked our work using MR, MRR, Hits@1, and Hits@10, which let us do a good comparison with baselines like TransE, ComplEx, RESCAL, and ConvE. The results showed our system improved MRR by 9-14% and Hits@10 by as much as 12% compared to other good systems. It was especially good at understanding things like subtype of and interacts with. In short, this research gives a way that can be scaled, is based on math and biology for filling in the blanks in biomedical knowledge graphs. By putting together relation-aware modeling, constraint-guided learning, and several ways of measuring, our method moves forward knowledge graph-based in cancer research and gives a method that can be copied for use in other bio fields.
Published
2026-03-20
How to Cite
Senhaji Yassine, El Moutaouakil Karim, Oulaika Abdelfattah, EL Marnissi Boujemaa, & Hafidi Youssef. (2026). Relation type-aware knowledge graph embeddings for biomedical data: a semantically adaptive framework. Statistics, Optimization & Information Computing. https://doi.org/10.19139/soic-2310-5070-3706
Issue
Section
Research Articles
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).