Graph Embeddings: Theory meets Practice (Dagstuhl Seminar 22132)

Authors Martin Grohe, Stephan Günnemann, Stefanie Jegelka, Christopher Morris and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.12.3.141.pdf
  • Filesize: 4.12 MB
  • 15 pages

Document Identifiers

Author Details

Martin Grohe
  • RWTH Aachen University, DE
Stephan Günnemann
  • TU München, DE
Stefanie Jegelka
  • MIT - Cambridge, US
Christopher Morris
  • McGill University & MILA - Montreal
and all authors of the abstracts in this report

Cite AsGet BibTex

Martin Grohe, Stephan Günnemann, Stefanie Jegelka, and Christopher Morris. Graph Embeddings: Theory meets Practice (Dagstuhl Seminar 22132). In Dagstuhl Reports, Volume 12, Issue 3, pp. 141-155, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/DagRep.12.3.141

Abstract

Vectorial representations of graphs and relational structures, so-called graph embeddings, make it possible to apply standard tools from data mining, machine learning, and statistics to the graph domain. In particular, graph embeddings aim to capture important information about, both, the graph structure and available side information as a vector, to enable downstream tasks such as classification, regression, or clustering. Starting from the 1960s in chemoinformatics, research in various communities has resulted in a plethora of approaches, often with recurring ideas. However, most of the field advancements are driven by intuition and empiricism, often tailored to a specific application domain. Until recently, the area has received little stimulus from theoretical computer science, graph theory, and learning theory. The Dagstuhl Seminar 22132 "Graph Embeddings: Theory meets Practice", was aimed to gather leading applied and theoretical researchers in graph embeddings and adjacent areas, such as graph isomorphism, bio- and chemoinformatics, and graph theory, to stimulate an increased exchange of ideas between these communities.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Discrete mathematics
  • Computing methodologies → Machine learning
Keywords
  • Machine Learning For Graphs
  • GNNs
  • Graph Embedding

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail