Dennis Rohde

activity

20182020

collaborators

4 papers

cs.CG2020

Approximating $(k, ℓ)$ -Median Clustering for Polygonal Curves

Maike Buchin, Anne Driemel, Dennis Rohde

In 2015, Driemel, Krivošija and Sohler introduced the $(k, ℓ)$ -median problem for clustering polygonal curves under the Fréchet distance. Given a set of input curves, the problem…

cs.LG2019

Random Projections and Sampling Algorithms for Clustering of High-Dimensional Polygonal Curves

Stefan Meintrup, Alexander Munteanu, Dennis Rohde

We study the $k$ -median clustering problem for high-dimensional polygonal curves with finite but unbounded number of vertices. We tackle the computational issue that arises from th…

cs.CG2019

Coresets for $(k, l)$ -Clustering under the Fréchet Distance

Dennis Rohde

Clustering is the task of partitioning a given set of geometric objects. This is thoroughly studied when the objects are points in the euclidean space. There are also several appro…

cs.LG2018

A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice

Hendrik Fichtenberger, Dennis Rohde

In the $k$ -nearest neighborhood model ( $k$ -NN), we are given a set of points $P$ , and we shall answer queries $q$ by returning the $k$ nearest neighbors of $q$ in $P$ according to…

Approximating (k,ℓ)-Median Clustering for Polygonal Curves

Random Projections and Sampling Algorithms for Clustering of High-Dimensional Polygonal Curves

Coresets for (k,l)-Clustering under the Fréchet Distance

A Theory-Based Evaluation of Nearest Neighbor Models Put Into Practice

Approximating $(k, ℓ)$ -Median Clustering for Polygonal Curves

Coresets for $(k, l)$ -Clustering under the Fréchet Distance