Temporal Graph Kernels for Classifying Dissemination Processes

  title={Temporal Graph Kernels for Classifying Dissemination Processes},
  author={Lutz Oettershagen and Nils M. Kriege and C. Morris and Petra Mutzel},
  • Lutz Oettershagen, Nils M. Kriege, +1 author Petra Mutzel
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • Many real-world graphs or networks are temporal, e.g., in a social network persons only interact at specific points in time. This information directs dissemination processes on the network, such as the spread of rumors, fake news, or diseases. However, the current state-of-the-art methods for supervised graph classification are designed mainly for static graphs and may not be able to capture temporal information. Hence, they are not powerful enough to distinguish between graphs modeling… CONTINUE READING
    1 Citations

    Figures, Tables, and Topics from this paper


    Modeling evolution of a social network using temporalgraph kernels
    • 4
    Cheetah: Fast Graph Kernel Tracking on Dynamic Graphs
    • 13
    • PDF
    Time Series Prediction for Graphs in Kernel and Dissimilarity Spaces
    • 4
    • PDF
    Global Weisfeiler-Lehman Graph Kernels
    • 5
    • PDF
    A Degeneracy Framework for Graph Similarity
    • 32
    • PDF
    Continuous-Time Dynamic Network Embeddings
    • 135
    • PDF
    A survey on graph kernels
    • 66
    • PDF
    Epidemiologically Optimal Static Networks from Temporal Network Data
    • 46
    • PDF
    Modern temporal network theory: a colloquium
    • 398
    • PDF
    Shortest-path kernels on graphs
    • K. Borgwardt, H. Kriegel
    • Mathematics, Computer Science
    • Fifth IEEE International Conference on Data Mining (ICDM'05)
    • 2005
    • 668
    • PDF