WeightedHGE: Weighted Heterogeneous Graph Embedding
In this paper, we introduce a novel method for embedding weighted graphs, designed to capture the significance of relationships in real-world weighted graph data. Unlike existing models that treat all relationships equally, our approach incorporates edge weights directly into the embedding process, enhancing the representation of highly weighted connections. By introducing modifications to both the scoring and loss functions, our method emphasizes the importance of weighted relationships during training. Theoretical analysis shows that our model maintains efficiency and scalability while significantly improving the capacity to represent weighted graph structures. Experimental results demonstrate that our approach consistently outperforms baseline methods, including TransE, in tasks involving weighted relationships, showcasing its robustness and applicability.
Authors
- Engelbert Mephu Nguifo (ORCID: https://orcid.org/0000-0001-9119-678X)
- Sami Zghal (ORCID: https://orcid.org/0000-0001-5703-6010)
- Wissem Inoubli (ORCID: https://orcid.org/0000-0001-5121-9043)
- Khouloud Ammar
Institutions
- Centre National de la Recherche Scientifique (FR)
- University of Clermont Auvergne (FR)
- Clermont Université (FR)
- Université d'Artois (FR)
- University of Jendouba (TN)
- Tunis El Manar University (TN)
Publication Details
- Journal
- Procedia Computer Science
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1016/j.procs.2025.09.419
- Primary Topic
- Advanced Graph Neural Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.00