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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

WeightedHGE: Weighted Heterogeneous Graph Embedding

Engelbert Mephu Nguifo, Sami Zghal, Wissem Inoubli, Khouloud Ammar
Procedia Computer Science
Advanced Graph Neural Networks
article

WeightedHGE: Weighted Heterogeneous Graph Embedding

Engelbert Mephu Nguifo, Sami Zghal, Wissem Inoubli, Khouloud Ammar
article en

Abstract

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.

Procedia Computer ScienceVol. 270
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)
Openalex Percentile: Top 83%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.