Comparing temporal graphs using dynamic time warping

  title={Comparing temporal graphs using dynamic time warping},
  author={Vincent Froese and Brijnesh J. Jain and R. Niedermeier and M. Renken},
  journal={Social Network Analysis and Mining},
  • Vincent Froese, Brijnesh J. Jain, +1 author M. Renken
  • Published 2020
  • Computer Science, Mathematics
  • Social Network Analysis and Mining
  • Within many real-world networks, the links between pairs of nodes change over time. Thus, there has been a recent boom in studying temporal graphs. Recognizing patterns in temporal graphs requires a proximity measure to compare different temporal graphs. To this end, we propose to study dynamic time warping on temporal graphs. We define the dynamic temporal graph warping (dtgw) distance to determine the dissimilarity of two temporal graphs. Our novel measure is flexible and can be applied in… CONTINUE READING
    1 Citations

    Figures and Tables from this paper

    Comparing Temporal Graphs Using Dynamic Time Warping
    • 3
    • PDF


    Comparing Temporal Graphs Using Dynamic Time Warping
    • 3
    • PDF
    Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
    • 31
    • PDF
    Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series
    • 7
    • PDF
    Speeding Up All-Pairwise Dynamic Time Warping Matrix Calculation
    • 76
    • PDF
    The Complexity of Finding Small Separators in Temporal Graphs
    • 22
    • PDF
    Spatio-temporal networks: reachability, centrality and robustness
    • 44
    • PDF
    Multistage Problems on a Global Budget
    • 6
    Comparing Stars: On Approximating Graph Edit Distance
    • 309
    • PDF
    The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
    • 14
    • PDF