159 citations · 192 across the 6 of their papers we have counts for
8 papers
On Coreset Constructions for the Fuzzy -Means Problem
Johannes Blömer, Sascha Brauer, Kathrin Bujna
The fuzzy -means problem is a popular generalization of the well-known -means problem to soft clusterings. We present the first coresets for fuzzy -means with size linear…
Hard-Clustering with Gaussian Mixture Models
Johannes Blömer, Sascha Brauer, Kathrin Bujna
Training the parameters of statistical models to describe a given data set is a central task in the field of data mining and machine learning. A very popular and powerful way of pa…
Theoretical Analysis of the -Means Algorithm - A Survey
Johannes Blömer, Christiane Lammersen, Melanie Schmidt +1
The -means algorithm is one of the most widely used clustering heuristics. Despite its simplicity, analyzing its running time and quality of approximation is surprisingly diffic…
Complexity and Approximation of the Fuzzy K-Means Problem
Johannes Blömer, Sascha Brauer, Kathrin Bujna
The fuzzy -means problem is a generalization of the classical -means problem to soft clusterings, i.e. clusterings where each points belongs to each cluster to some degree. A…
Voronoi Cells of Lattices with Respect to Arbitrary Norms
Johannes Blömer, Kathlén Kohn
We study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms. On the positive side, we show for strictly convex and smooth norms that the geome…
Adaptive Seeding for Gaussian Mixture Models
Johannes Blömer, Kathrin Bujna
We present new initialization methods for the expectation-maximization algorithm for multivariate Gaussian mixture models. Our methods are adaptions of the well-known -means++ i…
Solving the Closest Vector Problem with respect to l_p Norms
Johannes Blömer, Stefanie Naewe
In this paper, we present a deterministic algorithm for the closest vector problem for all l_p-norms, 1 < p < \infty, and all polyhedral norms, especially for the l_1-norm and the…
Analysis of Agglomerative Clustering
Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze +1
The diameter -clustering problem is the problem of partitioning a finite subset of into subsets called clusters such that the maximum diameter of the clusters…