Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical Study of Fuzzy K-Means.”https://doi.org/10.1145/3409385__ACM Transactions on Algorithms 16, no. 4 (2020): 1–25.https://doi.org/10.1145/3409385 .
LibreCat: /record/20888
DOI: 10.1145/3409385

Blömer, Johannes, Sascha Brauer, Kathrin Bujna, and Daniel Kuntze. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.”https://doi.org/10.1007/s11634-019-00366-7__Advances in Data Analysis and Classification 14 (2020): 147–173.https://doi.org/10.1007/s11634-019-00366-7 .
LibreCat: /record/10790
DOI: 10.1007/s11634-019-00366-7

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”https://doi.org/10.1016/j.tcs.2018.04.048__Theoretical Computer Science 754 (2019): 88–106.https://doi.org/10.1016/j.tcs.2018.04.048 .
LibreCat: /record/2916
DOI: 10.1016/j.tcs.2018.04.048

Brauer, Sascha. Classification and Approximation of Geometric Location Problems. Paderborn, 2019.https://doi.org/10.17619/UNIPB/1-816 .
LibreCat: /record/13679
DOI: 10.17619/UNIPB/1-816

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.”https://doi.org/10.4230/LIPIcs.ISAAC.2018.46__In 29th International Symposium on Algorithms and Computation  (ISAAC 2018), 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.https://doi.org/10.4230/LIPIcs.ISAAC.2018.46 .
LibreCat: /record/4344
DOI: 10.4230/LIPIcs.ISAAC.2018.46

Bujna, Kathrin. Soft Clustering Algorithms - Theoretical and Practical Improvements. Universität Paderborn, 2017.https://doi.org/10.17619/UNIPB/1-226 .
LibreCat: /record/2908
DOI: 10.17619/UNIPB/1-226

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”https://doi.org/10.1007/978-3-319-57586-5_11__In Lecture Notes in Computer Science, edited by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27. Cham: Springer International Publishing, 2017.https://doi.org/10.1007/978-3-319-57586-5_11 .
LibreCat: /record/2381
DOI: 10.1007/978-3-319-57586-5_11

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.
LibreCat: /record/2969

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”https://doi.org/10.1007/978-3-319-31750-2_24__In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-31750-2_24 .
LibreCat: /record/2970
DOI: 10.1007/978-3-319-31750-2_24

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis of the Fuzzy K-Means Problem.”https://doi.org/10.1109/icdm.2016.0094__In 2016 IEEE 16th International Conference on Data Mining (ICDM), 805–10. IEEE, 2016.https://doi.org/10.1109/icdm.2016.0094 .
LibreCat: /record/2367
DOI: 10.1109/icdm.2016.0094

Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures, 2014.
LibreCat: /record/2900

Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian Sohler. “Analysis of Agglomerative Clustering.”https://doi.org/10.1007/s00453-012-9717-4__Algorithmica 69 (2014).https://doi.org/10.1007/s00453-012-9717-4 .
LibreCat: /record/2976
DOI: 10.1007/s00453-012-9717-4

Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.”https://doi.org/10.1109/icpr.2014.253__In 2014 22nd International Conference on Pattern Recognition. IEEE, 2014.https://doi.org/10.1109/icpr.2014.253 .
LibreCat: /record/2977
DOI: 10.1109/icpr.2014.253

Kuntze, Daniel. Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements. Universität Paderborn, 2013.
LibreCat: /record/2909

Ackermann, Marcel Rudolf, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, and Christian Sohler. “StreamKM++: A Clustering Algorithm for Data Streams.”https://doi.org/10.1145/2133803.2184450__ACM Journal of Experimental Algorithmics. New York, NY, USA: ACM, 2012.https://doi.org/10.1145/2133803.2184450 .
LibreCat: /record/2982
DOI: 10.1145/2133803.2184450

Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011.
LibreCat: /record/2985

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”https://doi.org/10.1007/978-3-642-13731-0_21__In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.https://doi.org/10.1007/978-3-642-13731-0_21 .
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.”https://doi.org/10.1145/1824777.1824779__ACM Trans. Algorithms, no. 4 (2010): 59:1--59:26.https://doi.org/10.1145/1824777.1824779 .
LibreCat: /record/2990
DOI: 10.1145/1824777.1824779

Krueger, Alexander, Volker Leutnant, Reinhold Haeb-Umbach, Marcel Ackermann, and Johannes Blömer. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat: /record/2991

Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.
LibreCat: /record/2911