Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
21 Publications
2009 | Dissertation | LibreCat-ID: 2911
Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.
LibreCat
| Download (ext.)
2009 | Book Chapter | LibreCat-ID: 2995
Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 1088–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. https://doi.org/10.1137/1.9781611973068.118.
LibreCat
| DOI
2010 | Book Chapter | LibreCat-ID: 2988
Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” 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
| DOI
2010 | Journal Article | LibreCat-ID: 2990
Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.” ACM Trans. Algorithms, no. 4 (2010): 59:1--59:26. https://doi.org/10.1145/1824777.1824779.
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 2991
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
2011 | Conference Paper | LibreCat-ID: 2985
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
2012 | Conference Paper | LibreCat-ID: 2982
Ackermann, Marcel Rudolf, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, and Christian Sohler. “StreamKM++: A Clustering Algorithm for Data Streams.” ACM Journal of Experimental Algorithmics. New York, NY, USA: ACM, 2012. https://doi.org/10.1145/2133803.2184450.
LibreCat
| DOI
2013 | Dissertation | LibreCat-ID: 2909
Kuntze, Daniel. Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements. Universität Paderborn, 2013.
LibreCat
| Download (ext.)
2014 | Mastersthesis | LibreCat-ID: 2900
Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures, 2014.
LibreCat
| Files available
2014 | Journal Article | LibreCat-ID: 2976
Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian Sohler. “Analysis of Agglomerative Clustering.” Algorithmica 69 (2014). https://doi.org/10.1007/s00453-012-9717-4.
LibreCat
| DOI
2014 | Conference Paper | LibreCat-ID: 2977
Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.” In 2014 22nd International Conference on Pattern Recognition. IEEE, 2014. https://doi.org/10.1109/icpr.2014.253.
LibreCat
| DOI
2016 | Preprint | LibreCat-ID: 2969 | 
Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.
LibreCat
| Download (ext.)
2016 | Book Chapter | LibreCat-ID: 2970
Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” 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
| DOI
2016 | Conference Paper | LibreCat-ID: 2367
Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis of the Fuzzy K-Means Problem.” In 2016 IEEE 16th International Conference on Data Mining (ICDM), 805–10. IEEE, 2016. https://doi.org/10.1109/icdm.2016.0094.
LibreCat
| DOI
2017 | Dissertation | LibreCat-ID: 2908
Bujna, Kathrin. Soft Clustering Algorithms - Theoretical and Practical Improvements. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-226.
LibreCat
| DOI
| Download (ext.)
2017 | Book Chapter | LibreCat-ID: 2381
Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” 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
| DOI
2018 | Conference Paper | LibreCat-ID: 4344
Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.” 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
| DOI
2019 | Journal Article | LibreCat-ID: 2916
Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” Theoretical Computer Science 754 (2019): 88–106. https://doi.org/10.1016/j.tcs.2018.04.048.
LibreCat
| DOI
2019 | Dissertation | LibreCat-ID: 13679
Brauer, Sascha. Classification and Approximation of Geometric Location Problems. Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-816.
LibreCat
| DOI
2020 | Journal Article | LibreCat-ID: 20888
Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical Study of Fuzzy K-Means.” ACM Transactions on Algorithms 16, no. 4 (2020): 1–25. https://doi.org/10.1145/3409385.
LibreCat
| DOI
2020 | Journal Article | LibreCat-ID: 10790
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.” Advances in Data Analysis and Classification 14 (2020): 147–173. https://doi.org/10.1007/s11634-019-00366-7.
LibreCat
| DOI