5 citations · 14 across the 7 of their papers we have counts for
4 papers · 1 filter
Noisy, Greedy and Not So Greedy k-means++
Anup Bhattacharya, Jan Eube, Heiko Röglin +1
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 d…
Fully dynamic hierarchical diameter k-clustering and k-center
Melanie Schmidt, Christian Sohler
We develop dynamic data structures for maintaining a hierarchical k-center clustering when the points come from a discrete space . Our first data structure is for…
Sublinear data structures for short Fréchet queries
Anne Driemel, Ioannis Psarros, Melanie Schmidt
We study metric data structures for curves in doubling spaces, such as trajectories of moving objects in Euclidean , where the distance between two curves is measured…
Analysis of Ward's Method
Anna Großwendt, Heiko Röglin, Melanie Schmidt
We study Ward's method for the hierarchical -means problem. This popular greedy heuristic is based on the \emph{complete linkage} paradigm: Starting with all data points as sing…