[{"year":"2020","citation":{"ieee":"J. Blömer, S. Brauer, and K. Bujna, “A Complexity Theoretical Study of Fuzzy K-Means,” <i>ACM Transactions on Algorithms</i>, vol. 16, no. 4, pp. 1–25, 2020.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical Study of Fuzzy K-Means.” <i>ACM Transactions on Algorithms</i> 16, no. 4 (2020): 1–25. <a href=\"https://doi.org/10.1145/3409385\">https://doi.org/10.1145/3409385</a>.","ama":"Blömer J, Brauer S, Bujna K. A Complexity Theoretical Study of Fuzzy K-Means. <i>ACM Transactions on Algorithms</i>. 2020;16(4):1-25. doi:<a href=\"https://doi.org/10.1145/3409385\">10.1145/3409385</a>","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2020). A Complexity Theoretical Study of Fuzzy K-Means. <i>ACM Transactions on Algorithms</i>, <i>16</i>(4), 1–25. <a href=\"https://doi.org/10.1145/3409385\">https://doi.org/10.1145/3409385</a>","bibtex":"@article{Blömer_Brauer_Bujna_2020, title={A Complexity Theoretical Study of Fuzzy K-Means}, volume={16}, DOI={<a href=\"https://doi.org/10.1145/3409385\">10.1145/3409385</a>}, number={4}, journal={ACM Transactions on Algorithms}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2020}, pages={1–25} }","mla":"Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.” <i>ACM Transactions on Algorithms</i>, vol. 16, no. 4, 2020, pp. 1–25, doi:<a href=\"https://doi.org/10.1145/3409385\">10.1145/3409385</a>.","short":"J. Blömer, S. Brauer, K. Bujna, ACM Transactions on Algorithms 16 (2020) 1–25."},"page":"1-25","intvolume":"        16","publication_status":"published","publication_identifier":{"issn":["1549-6325","1549-6333"]},"issue":"4","title":"A Complexity Theoretical Study of Fuzzy K-Means","doi":"10.1145/3409385","date_updated":"2022-01-06T06:54:41Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"id":"13291","full_name":"Brauer, Sascha","last_name":"Brauer","first_name":"Sascha"},{"first_name":"Kathrin","last_name":"Bujna","full_name":"Bujna, Kathrin"}],"date_created":"2021-01-08T08:51:42Z","volume":16,"status":"public","type":"journal_article","publication":"ACM Transactions on Algorithms","language":[{"iso":"eng"}],"project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"_id":"20888","user_id":"13291","department":[{"_id":"64"}]},{"type":"journal_article","publication":"Advances in Data Analysis and Classification","status":"public","project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"_id":"10790","user_id":"13291","department":[{"_id":"64"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1862-5347","1862-5355"]},"year":"2020","citation":{"short":"J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and Classification 14 (2020) 147–173.","bibtex":"@article{Blömer_Brauer_Bujna_Kuntze_2020, title={How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models}, volume={14}, DOI={<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>}, journal={Advances in Data Analysis and Classification}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin and Kuntze, Daniel}, year={2020}, pages={147–173} }","mla":"Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” <i>Advances in Data Analysis and Classification</i>, vol. 14, 2020, pp. 147–173, doi:<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>.","apa":"Blömer, J., Brauer, S., Bujna, K., &#38; Kuntze, D. (2020). How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. <i>Advances in Data Analysis and Classification</i>, <i>14</i>, 147–173. <a href=\"https://doi.org/10.1007/s11634-019-00366-7\">https://doi.org/10.1007/s11634-019-00366-7</a>","ieee":"J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models,” <i>Advances in Data Analysis and Classification</i>, vol. 14, pp. 147–173, 2020.","chicago":"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.” <i>Advances in Data Analysis and Classification</i> 14 (2020): 147–173. <a href=\"https://doi.org/10.1007/s11634-019-00366-7\">https://doi.org/10.1007/s11634-019-00366-7</a>.","ama":"Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. <i>Advances in Data Analysis and Classification</i>. 2020;14:147–173. doi:<a href=\"https://doi.org/10.1007/s11634-019-00366-7\">10.1007/s11634-019-00366-7</a>"},"page":"147–173","intvolume":"        14","date_updated":"2022-01-06T06:50:50Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Sascha","id":"13291","full_name":"Brauer, Sascha","last_name":"Brauer"},{"last_name":"Bujna","full_name":"Bujna, Kathrin","first_name":"Kathrin"},{"full_name":"Kuntze, Daniel","last_name":"Kuntze","first_name":"Daniel"}],"date_created":"2019-07-11T08:08:25Z","volume":14,"title":"How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models","doi":"10.1007/s11634-019-00366-7"},{"publisher":"Elsevier","date_updated":"2022-01-06T06:58:46Z","date_created":"2018-05-25T11:10:36Z","author":[{"first_name":"Sascha","id":"13291","full_name":"Brauer, Sascha","last_name":"Brauer"}],"volume":754,"title":"Complexity of single-swap heuristics for metric facility location and related problems","doi":"10.1016/j.tcs.2018.04.048","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"year":"2019","citation":{"chicago":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” <i>Theoretical Computer Science</i> 754 (2019): 88–106. <a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">https://doi.org/10.1016/j.tcs.2018.04.048</a>.","ieee":"S. Brauer, “Complexity of single-swap heuristics for metric facility location and related problems,” <i>Theoretical Computer Science</i>, vol. 754, pp. 88–106, 2019.","ama":"Brauer S. Complexity of single-swap heuristics for metric facility location and related problems. <i>Theoretical Computer Science</i>. 2019;754:88-106. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">10.1016/j.tcs.2018.04.048</a>","apa":"Brauer, S. (2019). Complexity of single-swap heuristics for metric facility location and related problems. <i>Theoretical Computer Science</i>, <i>754</i>, 88–106. <a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">https://doi.org/10.1016/j.tcs.2018.04.048</a>","bibtex":"@article{Brauer_2019, title={Complexity of single-swap heuristics for metric facility location and related problems}, volume={754}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">10.1016/j.tcs.2018.04.048</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Brauer, Sascha}, year={2019}, pages={88–106} }","mla":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” <i>Theoretical Computer Science</i>, vol. 754, Elsevier, 2019, pp. 88–106, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">10.1016/j.tcs.2018.04.048</a>.","short":"S. Brauer, Theoretical Computer Science 754 (2019) 88–106."},"intvolume":"       754","page":"88-106","project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"_id":"2916","user_id":"13291","department":[{"_id":"64"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Theoretical Computer Science","status":"public"},{"date_updated":"2022-01-06T06:51:41Z","date_created":"2019-10-09T10:00:53Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"author":[{"last_name":"Brauer","full_name":"Brauer, Sascha","id":"13291","first_name":"Sascha"}],"title":"Classification and Approximation of Geometric Location Problems","doi":"10.17619/UNIPB/1-816","year":"2019","place":"Paderborn","citation":{"bibtex":"@book{Brauer_2019, place={Paderborn}, title={Classification and Approximation of Geometric Location Problems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-816\">10.17619/UNIPB/1-816</a>}, author={Brauer, Sascha}, year={2019} }","mla":"Brauer, Sascha. <i>Classification and Approximation of Geometric Location Problems</i>. 2019, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-816\">10.17619/UNIPB/1-816</a>.","short":"S. Brauer, Classification and Approximation of Geometric Location Problems, Paderborn, 2019.","apa":"Brauer, S. (2019). <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-816\">https://doi.org/10.17619/UNIPB/1-816</a>","chicago":"Brauer, Sascha. <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn, 2019. <a href=\"https://doi.org/10.17619/UNIPB/1-816\">https://doi.org/10.17619/UNIPB/1-816</a>.","ieee":"S. Brauer, <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn, 2019.","ama":"Brauer S. <i>Classification and Approximation of Geometric Location Problems</i>. Paderborn; 2019. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-816\">10.17619/UNIPB/1-816</a>"},"_id":"13679","project":[{"_id":"45","name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen"}],"department":[{"_id":"64"}],"user_id":"13291","language":[{"iso":"eng"}],"type":"dissertation","status":"public"},{"status":"public","publication":"29th International Symposium on Algorithms and Computation  (ISAAC 2018)","type":"conference","language":[{"iso":"eng"}],"_id":"4344","project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"department":[{"_id":"64"}],"user_id":"13291","year":"2018","page":"46:1--46:12","citation":{"ieee":"J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,” in <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.” In <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>.","ama":"Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications. In: <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">10.4230/LIPIcs.ISAAC.2018.46</a>","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2018). Coresets for Fuzzy K-Means with Applications. In <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i> (pp. 46:1--46:12). Jiaoxi, Yilan County, Taiwan: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>","mla":"Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.” <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">10.4230/LIPIcs.ISAAC.2018.46</a>.","bibtex":"@inproceedings{Blömer_Brauer_Bujna_2018, title={Coresets for Fuzzy K-Means with Applications}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ISAAC.2018.46\">10.4230/LIPIcs.ISAAC.2018.46</a>}, booktitle={29th International Symposium on Algorithms and Computation  (ISAAC 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2018}, pages={46:1--46:12} }","short":"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."},"publication_identifier":{"isbn":["978-3-95977-094-1"]},"publication_status":"published","title":"Coresets for Fuzzy K-Means with Applications","conference":{"name":"29th International Symposium on Algorithms and Computation (ISAAC)","start_date":"2018-12-17","end_date":"2018-12-19","location":"Jiaoxi, Yilan County, Taiwan"},"doi":"10.4230/LIPIcs.ISAAC.2018.46","date_updated":"2022-01-06T07:00:57Z","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","date_created":"2018-09-03T08:04:19Z","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Sascha","last_name":"Brauer","id":"13291","full_name":"Brauer, Sascha"},{"first_name":"Kathrin","full_name":"Bujna, Kathrin","last_name":"Bujna"}]}]