Zobrazeno 1 - 10
of 366
pro vyhledávání: '"Röglin A"'
The DTW Barycenter Averaging (DBA) algorithm is a widely used algorithm for estimating the mean of a given set of point sequences. In this context, the mean is defined as a point sequence that minimises the sum of dynamic time warping distances (DTW)
Externí odkaz:
http://arxiv.org/abs/2401.05841
Publikováno v:
Algorithmica, 68(1):190-264, 2014
2-Opt is probably the most basic local search heuristic for the TSP. This heuristic achieves amazingly good results on real world Euclidean instances both with respect to running time and approximation ratio. There are numerous experimental studies o
Externí odkaz:
http://arxiv.org/abs/2302.06889
Autor:
Drexler, Lukas, Eube, Jan, Luo, Kelin, Reineccius, Dorian, Röglin, Heiko, Schmidt, Melanie, Wargalla, Julian
Motivated by an application from geodesy, we introduce a novel clustering problem which is a $k$-center (or k-diameter) problem with a side constraint. For the side constraint, we are given an undirected connectivity graph $G$ on the input points, an
Externí odkaz:
http://arxiv.org/abs/2211.02176
Autor:
Arutyunova, Anna, Röglin, Heiko
Hierarchical Clustering is a popular tool for understanding the hereditary properties of a data set. Such a clustering is actually a sequence of clusterings that starts with the trivial clustering in which every data point forms its own cluster and t
Externí odkaz:
http://arxiv.org/abs/2205.01417
Autor:
Arutyunova, Anna, Driemel, Anne, Haunert, Jan-Henrik, Haverkort, Herman, Kusche, Jürgen, Langetepe, Elmar, Mayer, Philip, Mutzel, Petra, Röglin, Heiko
We apply state-of-the-art computational geometry methods to the problem of reconstructing a time-varying sea surface from tide gauge records. Our work builds on a recent article by Nitzke et al.~(Computers \& Geosciences, 157:104920, 2021) who have s
Externí odkaz:
http://arxiv.org/abs/2203.07325
Autor:
Röglin, Heiko
In a multiobjective optimization problem a solution is called Pareto-optimal if no criterion can be improved without deteriorating at least one of the other criteria. Computing the set of all Pareto-optimal solutions is a common task in multiobjectiv
Externí odkaz:
http://arxiv.org/abs/2010.11064
The k-means++ algorithm due to Arthur and Vassilvitskii has become the most popular seeding method for Lloyd's algorithm. It samples the first center uniformly at random from the data set and the other $k-1$ centers iteratively according to $D^2$-sam
Externí odkaz:
http://arxiv.org/abs/1912.00653
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We study Ward's method for the hierarchical $k$-means problem. This popular greedy heuristic is based on the \emph{complete linkage} paradigm: Starting with all data points as singleton clusters, it successively merges two clusters to form a clusteri
Externí odkaz:
http://arxiv.org/abs/1907.05094
Publikováno v:
In Science & Justice September 2022 62(5):520-529
