Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen

Project Period: 2017-01-01 – 2021-12-31
Further information can be found in the project profile.

To the project profile

5 Publications

2019 | Journal Article | LibreCat-ID: 2916
Complexity of single-swap heuristics for metric facility location and related problems
S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
LibreCat | DOI
 
2020 | Journal Article | LibreCat-ID: 20888
A Complexity Theoretical Study of Fuzzy K-Means
J. Blömer, S. Brauer, K. Bujna, ACM Transactions on Algorithms 16 (2020) 1–25.
LibreCat | DOI
 
2018 | Conference Paper | LibreCat-ID: 4344
Coresets for Fuzzy K-Means with Applications
J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms and Computation  (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12.
LibreCat | DOI
 
2020 | Journal Article | LibreCat-ID: 10790
How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models
J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and Classification 14 (2020) 147–173.
LibreCat | DOI
 
2019 | Dissertation | LibreCat-ID: 13679
Classification and Approximation of Geometric Location Problems
S. Brauer, Classification and Approximation of Geometric Location Problems, Paderborn, 2019.
LibreCat | DOI