<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>3849</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>16</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>10</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2020-06-29</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Comparing temporal graphs using dynamic time warping</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">Social Network Analysis and Mining</parentTitle>
    <identifier type="doi">10.1007/s13278-020-00664-5</identifier>
    <identifier type="urn">urn:nbn:de:bvb:898-opus4-38493</identifier>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Vincent Froese</author>
    <author>Brijnesh Jain</author>
    <author>Rolf Niedermeier</author>
    <author>Malte Renken</author>
    <collection role="ddc" number="0">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="oaweg" number="">Hybrid Open Access - OA-Veröffentlichung in einer Subskriptionszeitschrift/-medium</collection>
    <thesisPublisher>Ostbayerische Technische Hochschule Regensburg</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-oth-regensburg/files/3849/0.pdf</file>
  </doc>
  <doc>
    <id>3854</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>252</pageFirst>
    <pageLast>291</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>33</volume>
    <type>article</type>
    <publisherName>Springer Nature</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2019-01-15</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Exact mean computation in dynamic time warping spaces</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">Data Mining and Knowledge Discovery</parentTitle>
    <identifier type="doi">10.1007/s10618-018-0604-8</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Markus Brill</author>
    <author>Till Fluschnik</author>
    <author>Vincent Froese</author>
    <author>Brijnesh Jain</author>
    <author>Rolf Niedermeier</author>
    <author>David Schultz</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16315">Information und Kommunikation</collection>
  </doc>
</export-example>
