Higher-Order Graph Models: From Theoretical Foundations to Machine Learning (Dagstuhl Seminar 21352)

Authors Tina Eliassi-Rad, Vito Latora, Martin Rosvall, Ingo Scholtes and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.11.7.139.pdf
  • Filesize: 9.34 MB
  • 40 pages

Document Identifiers

Author Details

Tina Eliassi-Rad
  • Northeastern University - Boston, US
Vito Latora
  • Queen Mary University of London, GB
Martin Rosvall
  • University of Umeå, SE
Ingo Scholtes
  • Julius-Maximilians-Universität Würzburg, DE
  • Universität Zürich, CH
and all authors of the abstracts in this report

Cite AsGet BibTex

Tina Eliassi-Rad, Vito Latora, Martin Rosvall, and Ingo Scholtes. Higher-Order Graph Models: From Theoretical Foundations to Machine Learning (Dagstuhl Seminar 21352). In Dagstuhl Reports, Volume 11, Issue 7, pp. 139-178, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/DagRep.11.7.139

Abstract

Graph and network models are essential for data science applications in computer science, social sciences, and life sciences. They help to detect patterns in data on dyadic relations between pairs of genes, humans, or documents, and have improved our understanding of complex networks across disciplines. While the advantages of graph models of relational data are undisputed, we often have access to data with multiple types of higher-order relations not captured by simple graphs. Such data arise in social systems with non-dyadic or group-based interactions, multi-modal transportation networks with multiple connection types, or time series containing specific sequences of nodes traversed on paths. The complex relational structure of such data questions the validity of graph-based data mining and modelling, and jeopardises interdisciplinary applications of network analysis and machine learning. To address this challenge, researchers in topological data analysis, network science, machine learning, and physics recently started to generalise network analysis to higher-order graph models that capture more than dyadic relations. These higher-order models differ from standard network analysis in assumptions, applications, and mathematical formalisms. As a result, the emerging field lacks a shared terminology, common challenges, benchmark data and metrics to facilitate fair comparisons. By bringing together researchers from different disciplines, Dagstuhl Seminar 21352 "Higher-Order Graph Models: From Theoretical Foundations to Machine Learning" aimed at the development of a common language and a shared understanding of key challenges in the field that foster progress in data analytics and machine learning for data with complex relational structure. This report documents the program and the outcomes of this seminar.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Machine learning theory
  • Mathematics of computing → Graph theory
  • Human-centered computing → Graph drawings
  • Human-centered computing → Social network analysis
Keywords
  • (Social) Network analysis
  • Graph mining
  • Graph theory
  • Network science
  • Machine Learning
  • Statistical relational learning
  • Topological data analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads