Book · 2024 · Open access

Weighted Embeddings for Low-Dimensional Graph Representation

Thomas Bläsius, Jean-Pierre von der Heydt, Maximilian Katzmann, Nikolai Maas

Karlsruhe Institute of Technology · Published 8 October 2024 · DOI 10.48550/arxiv.2410.06042

Open PDFView at the publisherCite this paper

In brief

“Weighted Embeddings for Low-Dimensional Graph Representation” is a 2024 book by Thomas Bläsius and 3 co-authors. OpenAlex counts 0 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at Repository KITopen (Karlsruhe Institute of Technology).

Citations
0
References
36
Authors
4

Abstract

Learning low-dimensional numerical representations from symbolic data, e.g., embedding the nodes of a graph into a geometric space, is an important concept in machine learning. While embedding into Euclidean space is common, recent observations indicate that hyperbolic geometry is better suited to represent hierarchical information and heterogeneous data (e.g., graphs with a scale-free degree distribution). Despite their potential for more accurate representations, hyperbolic embeddings also have downsides like being more difficult to compute and harder to use in downstream tasks. We propose embedding into a weighted space, which is closely related to hyperbolic geometry but mathematically simpler. We provide the embedding algorithm WEmbed and demonstrate, based on generated as well as over 2000 real-world graphs, that our weighted embeddings heavily outperform state-of-the-art Euclidean embeddings for heterogeneous graphs while using fewer dimensions. The running time of WEmbed and embedding quality for the remaining instances is on par with state-of-the-art Euclidean embedders.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Bläsius, T., von der Heydt, J.-P., Katzmann, M., & Maas, N. (2024). Weighted Embeddings for Low-Dimensional Graph Representation. Karlsruhe Institute of Technology. https://doi.org/10.48550/arxiv.2410.06042

MLA 9

Bläsius, Thomas, et al. Weighted Embeddings for Low-Dimensional Graph Representation. Karlsruhe Institute of Technology, 2024. https://doi.org/10.48550/arxiv.2410.06042.

Chicago

Bläsius, Thomas, Jean-Pierre von der Heydt, Maximilian Katzmann, and Nikolai Maas. 2024. Weighted Embeddings for Low-Dimensional Graph Representation. Karlsruhe Institute of Technology. https://doi.org/10.48550/arxiv.2410.06042.

Harvard

Bläsius, T. et al. (2024) Weighted Embeddings for Low-Dimensional Graph Representation. Karlsruhe Institute of Technology. doi:10.48550/arxiv.2410.06042.

IEEE

T. Bläsius, J.-P. von der Heydt, M. Katzmann, and N. Maas, Weighted Embeddings for Low-Dimensional Graph Representation. Karlsruhe Institute of Technology, 2024, doi: 10.48550/arxiv.2410.06042.

BibTeX

@book{blasius2024weighted,
  title     = {{Weighted Embeddings for Low-Dimensional Graph Representation}},
  author    = {Bläsius, Thomas and von der Heydt, Jean-Pierre and Katzmann, Maximilian and Maas, Nikolai},
  publisher = {Karlsruhe Institute of Technology},
  year      = {2024},
  doi       = {10.48550/arxiv.2410.06042},
  url       = {https://doi.org/10.48550/arxiv.2410.06042}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks

  • graph embedding
  • hyperbolic geometry
  • heterogeneous graphs
  • scale-free networks
  • embedding algorithms
  • hierarchical information

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Bläsius, T., von der Heydt, J.-P., Katzmann, M., & Maas, N. (2024). Weighted Embeddings for Low-Dimensional Graph Representation. Karlsruhe Institute of Technology. https://doi.org/10.48550/arxiv.2410.06042

How many times has this paper been cited?

0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Repository KITopen (Karlsruhe Institute of Technology): sign in and open the PDF from this page.

Who wrote this paper?

Thomas Bläsius, Jean-Pierre von der Heydt, Maximilian Katzmann, Nikolai Maas.

What is the DOI of this paper?

10.48550/arxiv.2410.06042, permanently at https://doi.org/10.48550/arxiv.2410.06042. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.