TY - JOUR A1 - Froese, Vincent A1 - Jain, Brijnesh A1 - Niedermeier, Rolf A1 - Renken, Malte T1 - Comparing temporal graphs using dynamic time warping JF - Social Network Analysis and Mining N2 - 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 tem- poral graph warping (dtgw) distance to determine the dissimilarity of two temporal graphs. Our novel measure is flexible and can be applied in various application domains. We show that computing the dtgw-distance is a challenging (in general) NP-hard optimization problem and identify some polynomial-time solvable special cases. Moreover, we develop a quadratic programming formulation and an efficient heuristic. In experiments on real-world data, we show that the heuristic performs very well and that our dtgw-distance performs favorably in de-anonymizing networks compared to other approaches. Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-38493 VL - 10 SP - 1 EP - 16 PB - Springer Nature ER - TY - JOUR A1 - Brill, Markus A1 - Fluschnik, Till A1 - Froese, Vincent A1 - Jain, Brijnesh A1 - Niedermeier, Rolf A1 - Schultz, David T1 - Exact mean computation in dynamic time warping spaces JF - Data Mining and Knowledge Discovery N2 - Averaging time series under dynamic time warping is an important tool for improving nearest-neighbor classifiers and formulating centroid-based clustering. The most promising approach poses time series averaging as the problem of minimizing a Fréchet function. Minimizing the Fréchet function is NP-hard and so far solved by several heuristics and inexact strategies. Our contributions are as follows: we first discuss some inaccuracies in the literature on exact mean computation in dynamic time warping spaces. Then we propose an exponential-time dynamic program for computing a global minimum of the Fréchet function. The proposed algorithm is useful for benchmarking and evaluating known heuristics. In addition, we present an exact polynomial-time algorithm for the special case of binary time series. Based on the proposed exponential-time dynamic program, we empirically study properties like uniqueness and length of a mean, which are of interest for devising better heuristics. Experimental evaluations indicate substantial deficits of state-of-the-art heuristics in terms of their output quality. Y1 - 2019 U6 - https://doi.org/10.1007/s10618-018-0604-8 VL - 33 SP - 252 EP - 291 PB - Springer Nature ER - TY - JOUR A1 - Froese, Vincent A1 - Jain, Brijnesh A1 - Rymar, Maciej A1 - Welle, Mathias T1 - Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series JF - Algorithmica N2 - Dynamic Time Warping (DTW) is a well-known similarity measure for time series. The standard dynamic programming approach to compute the DTW distance of two length-n time series, however, requires O(n2) time, which is often too slow for real-world applications. Therefore, many heuristics have been proposed to speed up the DTW computation. These are often based on lower bounding techniques, approximating the DTW distance, or considering special input data such as binary or piecewise constant time series. In this paper, we present a first exact algorithm to compute the DTW distance of two run-length encoded time series whose running time only depends on the encoding lengths of the inputs. The worst-case running time is cubic in the encoding length. In experiments we show that our algorithm is indeed fast for time series with short encoding lengths. Y1 - 2022 U6 - https://doi.org/10.1007/s00453-022-01038-3 PB - Springer Nature ER - TY - JOUR A1 - Jain, Brijnesh A1 - Froese, Vincent A1 - Schultz, David T1 - An average-compress algorithm for the sample mean problem under dynamic time warping JF - Journal of Global Optimization N2 - Computing a sample mean of time series under dynamic time warping is NP-hard. Consequently, there is an ongoing research effort to devise efficient heuristics. The majority of heuristics have been developed for the constrained sample mean problem that assumes a solution of predefined length. In contrast, research on the unconstrained sample mean problem is underdeveloped. In this article, we propose a generic average-compress (AC) algorithm to address the unconstrained problem. The algorithm alternates between averaging (A-step) and compression (C-step). The A-step takes an initial guess as input and returns an approximation of a sample mean. Then the C-step reduces the length of the approximate solution. The compressed approximation serves as initial guess of the A-step in the next iteration. The purpose of the C-step is to direct the algorithm to more promising solutions of shorter length. The proposed algorithm is generic in the sense that any averaging and any compression method can be used. Experimental results show that the AC algorithm substantially outperforms current state-of-the-art algorithms for time series averaging. KW - Time series averaging KW - Fréchet function KW - Heuristic KW - Nonconvex optimization Y1 - 2023 U6 - https://doi.org/10.1007/s10898-023-01294-9 PB - Springer ER -